./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:16:39,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:16:39,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:16:39,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:16:39,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:16:39,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:16:39,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:16:39,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:16:39,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:16:39,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:16:39,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:16:39,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:16:39,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:16:39,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:16:39,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:16:39,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:16:39,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:16:39,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:16:39,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:16:39,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:16:39,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:16:39,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:16:39,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:16:39,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:16:39,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:16:39,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:16:39,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:16:39,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:16:39,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:16:39,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:16:39,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:16:39,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:16:39,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:16:39,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:16:39,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:16:39,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:16:39,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:16:39,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:16:39,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:16:39,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:16:39,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:16:39,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:16:39,618 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 [2024-11-18 22:16:39,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:16:39,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:16:39,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:16:39,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:16:39,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:16:39,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:16:41,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:16:41,612 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:16:41,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:16:41,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5afc02c/1a4332a82411489ab09c22ab1ef64d64/FLAG8fffed1f7 [2024-11-18 22:16:41,920 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5afc02c/1a4332a82411489ab09c22ab1ef64d64 [2024-11-18 22:16:41,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:16:41,923 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:16:41,924 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:16:41,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:16:41,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:16:41,929 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:41" (1/1) ... [2024-11-18 22:16:41,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5fba95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:41, skipping insertion in model container [2024-11-18 22:16:41,930 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:16:41" (1/1) ... [2024-11-18 22:16:41,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:16:42,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i[916,929] [2024-11-18 22:16:42,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:16:42,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:16:42,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i[916,929] [2024-11-18 22:16:42,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:16:42,244 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:16:42,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42 WrapperNode [2024-11-18 22:16:42,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:16:42,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:16:42,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:16:42,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:16:42,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,309 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-18 22:16:42,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:16:42,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:16:42,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:16:42,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:16:42,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:16:42,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,377 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:16:42,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:16:42,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:16:42,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:16:42,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (1/1) ... [2024-11-18 22:16:42,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:16:42,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:42,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:16:42,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:16:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:16:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:16:42,471 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:16:42,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:16:42,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:16:42,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:16:42,565 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:16:42,567 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:16:42,920 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-18 22:16:42,920 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:16:42,938 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:16:42,939 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:16:42,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:42 BoogieIcfgContainer [2024-11-18 22:16:42,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:16:42,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:16:42,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:16:42,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:16:42,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:16:41" (1/3) ... [2024-11-18 22:16:42,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558da362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:42, skipping insertion in model container [2024-11-18 22:16:42,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:16:42" (2/3) ... [2024-11-18 22:16:42,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558da362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:16:42, skipping insertion in model container [2024-11-18 22:16:42,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:42" (3/3) ... [2024-11-18 22:16:42,951 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:16:42,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:16:42,968 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:16:43,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:16:43,038 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42d5faaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:16:43,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:16:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:16:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 22:16:43,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:43,057 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:43,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:43,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1745630206, now seen corresponding path program 1 times [2024-11-18 22:16:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:43,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188400336] [2024-11-18 22:16:43,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2024-11-18 22:16:43,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188400336] [2024-11-18 22:16:43,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188400336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:16:43,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357827585] [2024-11-18 22:16:43,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:43,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:16:43,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:16:43,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:16:43,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:16:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:43,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:16:43,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:16:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2024-11-18 22:16:43,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:16:43,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357827585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:43,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:16:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:16:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041987156] [2024-11-18 22:16:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:16:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:16:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:16:43,698 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 22:16:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:43,727 INFO L93 Difference]: Finished difference Result 145 states and 250 transitions. [2024-11-18 22:16:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:16:43,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2024-11-18 22:16:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:43,736 INFO L225 Difference]: With dead ends: 145 [2024-11-18 22:16:43,737 INFO L226 Difference]: Without dead ends: 72 [2024-11-18 22:16:43,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:16:43,743 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:43,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-18 22:16:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-18 22:16:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:16:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-11-18 22:16:43,790 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 170 [2024-11-18 22:16:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-11-18 22:16:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 22:16:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-11-18 22:16:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 22:16:43,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:43,795 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:43,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 22:16:43,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:16:43,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:43,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1988678658, now seen corresponding path program 1 times [2024-11-18 22:16:43,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791406421] [2024-11-18 22:16:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:43,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:44,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791406421] [2024-11-18 22:16:44,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791406421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:44,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:44,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:16:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963446445] [2024-11-18 22:16:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:44,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:16:44,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:16:44,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:16:44,293 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:44,351 INFO L93 Difference]: Finished difference Result 163 states and 240 transitions. [2024-11-18 22:16:44,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:16:44,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-18 22:16:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:44,357 INFO L225 Difference]: With dead ends: 163 [2024-11-18 22:16:44,357 INFO L226 Difference]: Without dead ends: 94 [2024-11-18 22:16:44,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:16:44,360 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 25 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:44,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 214 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-18 22:16:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-11-18 22:16:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:16:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2024-11-18 22:16:44,374 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 170 [2024-11-18 22:16:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:44,376 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2024-11-18 22:16:44,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2024-11-18 22:16:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 22:16:44,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:44,381 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:44,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:16:44,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1605224060, now seen corresponding path program 1 times [2024-11-18 22:16:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660913688] [2024-11-18 22:16:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:48,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660913688] [2024-11-18 22:16:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660913688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:48,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:16:48,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713479611] [2024-11-18 22:16:48,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:48,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:16:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:16:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:16:48,103 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:48,353 INFO L93 Difference]: Finished difference Result 191 states and 278 transitions. [2024-11-18 22:16:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:16:48,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-18 22:16:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:48,356 INFO L225 Difference]: With dead ends: 191 [2024-11-18 22:16:48,357 INFO L226 Difference]: Without dead ends: 112 [2024-11-18 22:16:48,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:16:48,361 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 63 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:48,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:16:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-18 22:16:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2024-11-18 22:16:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:16:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-18 22:16:48,383 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 170 [2024-11-18 22:16:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:48,384 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-18 22:16:48,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-18 22:16:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-18 22:16:48,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:48,390 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:16:48,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:48,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -925165690, now seen corresponding path program 1 times [2024-11-18 22:16:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549294944] [2024-11-18 22:16:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549294944] [2024-11-18 22:16:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549294944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:51,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 22:16:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877751521] [2024-11-18 22:16:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:51,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:16:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:51,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:16:51,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 22:16:51,026 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:51,305 INFO L93 Difference]: Finished difference Result 203 states and 293 transitions. [2024-11-18 22:16:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 22:16:51,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2024-11-18 22:16:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:51,308 INFO L225 Difference]: With dead ends: 203 [2024-11-18 22:16:51,308 INFO L226 Difference]: Without dead ends: 110 [2024-11-18 22:16:51,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-18 22:16:51,309 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:51,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 460 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:16:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-18 22:16:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 82. [2024-11-18 22:16:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:16:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-11-18 22:16:51,318 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 170 [2024-11-18 22:16:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-11-18 22:16:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-11-18 22:16:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-18 22:16:51,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:51,322 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:16:51,322 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 901486687, now seen corresponding path program 1 times [2024-11-18 22:16:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239382879] [2024-11-18 22:16:51,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:51,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239382879] [2024-11-18 22:16:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239382879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 22:16:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438497031] [2024-11-18 22:16:54,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:54,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 22:16:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:54,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 22:16:54,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-18 22:16:54,212 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:54,819 INFO L93 Difference]: Finished difference Result 179 states and 260 transitions. [2024-11-18 22:16:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 22:16:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2024-11-18 22:16:54,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:54,823 INFO L225 Difference]: With dead ends: 179 [2024-11-18 22:16:54,824 INFO L226 Difference]: Without dead ends: 177 [2024-11-18 22:16:54,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-18 22:16:54,825 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 157 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:54,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 873 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 22:16:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-18 22:16:54,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-18 22:16:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 99 states have internal predecessors, (111), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 22:16:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2024-11-18 22:16:54,865 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 172 [2024-11-18 22:16:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:54,865 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2024-11-18 22:16:54,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:54,866 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2024-11-18 22:16:54,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-18 22:16:54,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:54,868 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:54,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 22:16:54,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:54,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:54,869 INFO L85 PathProgramCache]: Analyzing trace with hash 135908600, now seen corresponding path program 1 times [2024-11-18 22:16:54,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:54,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315574289] [2024-11-18 22:16:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315574289] [2024-11-18 22:16:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315574289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:54,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:16:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862794039] [2024-11-18 22:16:54,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:16:54,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:54,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:16:54,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:16:54,981 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:55,021 INFO L93 Difference]: Finished difference Result 317 states and 454 transitions. [2024-11-18 22:16:55,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:16:55,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2024-11-18 22:16:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:55,026 INFO L225 Difference]: With dead ends: 317 [2024-11-18 22:16:55,026 INFO L226 Difference]: Without dead ends: 187 [2024-11-18 22:16:55,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:16:55,027 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 41 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:55,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 236 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-18 22:16:55,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2024-11-18 22:16:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 90 states have (on average 1.1222222222222222) internal successors, (101), 92 states have internal predecessors, (101), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-18 22:16:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2024-11-18 22:16:55,058 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 174 [2024-11-18 22:16:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:55,059 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2024-11-18 22:16:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2024-11-18 22:16:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-18 22:16:55,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:55,061 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:55,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:16:55,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:55,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:55,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1383033368, now seen corresponding path program 1 times [2024-11-18 22:16:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:55,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460082842] [2024-11-18 22:16:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:16:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:16:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:16:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460082842] [2024-11-18 22:16:55,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460082842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:16:55,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:16:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:16:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134524598] [2024-11-18 22:16:55,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:16:55,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:16:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:16:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:16:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:16:55,149 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:16:55,215 INFO L93 Difference]: Finished difference Result 329 states and 477 transitions. [2024-11-18 22:16:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:16:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 174 [2024-11-18 22:16:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:16:55,217 INFO L225 Difference]: With dead ends: 329 [2024-11-18 22:16:55,217 INFO L226 Difference]: Without dead ends: 206 [2024-11-18 22:16:55,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:16:55,221 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 83 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:16:55,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 413 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:16:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-18 22:16:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 203. [2024-11-18 22:16:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 110 states have (on average 1.1090909090909091) internal successors, (122), 113 states have internal predecessors, (122), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-18 22:16:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 298 transitions. [2024-11-18 22:16:55,255 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 298 transitions. Word has length 174 [2024-11-18 22:16:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:16:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 298 transitions. [2024-11-18 22:16:55,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:16:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 298 transitions. [2024-11-18 22:16:55,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-18 22:16:55,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:16:55,261 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:16:55,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 22:16:55,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:16:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:16:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1028771903, now seen corresponding path program 1 times [2024-11-18 22:16:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:16:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076001541] [2024-11-18 22:16:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:16:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:16:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:17:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:17:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076001541] [2024-11-18 22:17:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076001541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:02,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:02,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 22:17:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557296754] [2024-11-18 22:17:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:02,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 22:17:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:17:02,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 22:17:02,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-18 22:17:02,712 INFO L87 Difference]: Start difference. First operand 203 states and 298 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:03,379 INFO L93 Difference]: Finished difference Result 248 states and 350 transitions. [2024-11-18 22:17:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:17:03,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-18 22:17:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:03,382 INFO L225 Difference]: With dead ends: 248 [2024-11-18 22:17:03,382 INFO L226 Difference]: Without dead ends: 246 [2024-11-18 22:17:03,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:17:03,383 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 110 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:03,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 773 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 22:17:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-18 22:17:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2024-11-18 22:17:03,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.1111111111111112) internal successors, (160), 149 states have internal predecessors, (160), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-18 22:17:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 344 transitions. [2024-11-18 22:17:03,448 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 344 transitions. Word has length 176 [2024-11-18 22:17:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 344 transitions. [2024-11-18 22:17:03,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 344 transitions. [2024-11-18 22:17:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-18 22:17:03,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:03,451 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:03,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 22:17:03,452 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:03,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1729836481, now seen corresponding path program 1 times [2024-11-18 22:17:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:17:03,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010607090] [2024-11-18 22:17:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:17:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:17:05,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:17:05,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010607090] [2024-11-18 22:17:05,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010607090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:05,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:05,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 22:17:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375548740] [2024-11-18 22:17:05,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 22:17:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:17:05,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 22:17:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-18 22:17:05,953 INFO L87 Difference]: Start difference. First operand 243 states and 344 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:06,457 INFO L93 Difference]: Finished difference Result 298 states and 405 transitions. [2024-11-18 22:17:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:17:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-18 22:17:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:06,460 INFO L225 Difference]: With dead ends: 298 [2024-11-18 22:17:06,460 INFO L226 Difference]: Without dead ends: 296 [2024-11-18 22:17:06,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-18 22:17:06,461 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 117 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:06,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 788 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 22:17:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-18 22:17:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2024-11-18 22:17:06,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 164 states have (on average 1.1219512195121952) internal successors, (184), 169 states have internal predecessors, (184), 92 states have call successors, (92), 6 states have call predecessors, (92), 6 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-18 22:17:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 368 transitions. [2024-11-18 22:17:06,502 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 368 transitions. Word has length 176 [2024-11-18 22:17:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:06,503 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 368 transitions. [2024-11-18 22:17:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 368 transitions. [2024-11-18 22:17:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-18 22:17:06,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:06,505 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 22:17:06,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:06,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -560045422, now seen corresponding path program 1 times [2024-11-18 22:17:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:17:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253662027] [2024-11-18 22:17:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:06,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:17:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:17:06,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:17:06,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253662027] [2024-11-18 22:17:06,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253662027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:06,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:06,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:17:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848707155] [2024-11-18 22:17:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:06,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:17:06,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:17:06,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:17:06,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:06,568 INFO L87 Difference]: Start difference. First operand 263 states and 368 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:06,618 INFO L93 Difference]: Finished difference Result 571 states and 798 transitions. [2024-11-18 22:17:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:17:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-18 22:17:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:06,623 INFO L225 Difference]: With dead ends: 571 [2024-11-18 22:17:06,623 INFO L226 Difference]: Without dead ends: 351 [2024-11-18 22:17:06,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:06,624 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 90 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:06,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 291 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:17:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-18 22:17:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2024-11-18 22:17:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 187 states have (on average 1.085561497326203) internal successors, (203), 194 states have internal predecessors, (203), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 129 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-18 22:17:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 475 transitions. [2024-11-18 22:17:06,674 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 475 transitions. Word has length 177 [2024-11-18 22:17:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 475 transitions. [2024-11-18 22:17:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 475 transitions. [2024-11-18 22:17:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-18 22:17:06,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:06,676 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 22:17:06,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:06,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash -778259498, now seen corresponding path program 1 times [2024-11-18 22:17:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:17:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987557482] [2024-11-18 22:17:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:17:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:17:06,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:17:06,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987557482] [2024-11-18 22:17:06,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987557482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:06,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:06,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:17:06,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889857391] [2024-11-18 22:17:06,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:06,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:17:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:17:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:17:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:06,734 INFO L87 Difference]: Start difference. First operand 333 states and 475 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:06,786 INFO L93 Difference]: Finished difference Result 634 states and 897 transitions. [2024-11-18 22:17:06,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:17:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-11-18 22:17:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:06,790 INFO L225 Difference]: With dead ends: 634 [2024-11-18 22:17:06,790 INFO L226 Difference]: Without dead ends: 344 [2024-11-18 22:17:06,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:06,792 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 93 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:06,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 208 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:17:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-18 22:17:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 329. [2024-11-18 22:17:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 178 states have (on average 1.0674157303370786) internal successors, (190), 183 states have internal predecessors, (190), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 135 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-18 22:17:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 470 transitions. [2024-11-18 22:17:06,839 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 470 transitions. Word has length 177 [2024-11-18 22:17:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:06,840 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 470 transitions. [2024-11-18 22:17:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 470 transitions. [2024-11-18 22:17:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-18 22:17:06,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:06,842 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:06,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 22:17:06,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1001609443, now seen corresponding path program 1 times [2024-11-18 22:17:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:17:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050430721] [2024-11-18 22:17:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:17:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:17:06,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:17:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:17:07,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:17:07,025 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:17:07,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:17:07,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 22:17:07,030 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:07,163 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:17:07,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:17:07 BoogieIcfgContainer [2024-11-18 22:17:07,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:17:07,171 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:17:07,171 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:17:07,171 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:17:07,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:16:42" (3/4) ... [2024-11-18 22:17:07,174 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:17:07,179 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:17:07,182 INFO L158 Benchmark]: Toolchain (without parser) took 25259.70ms. Allocated memory was 180.4MB in the beginning and 903.9MB in the end (delta: 723.5MB). Free memory was 146.7MB in the beginning and 582.2MB in the end (delta: -435.4MB). Peak memory consumption was 290.2MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,183 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:17:07,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.13ms. Allocated memory is still 180.4MB. Free memory was 146.7MB in the beginning and 129.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.42ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 124.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,183 INFO L158 Benchmark]: Boogie Preprocessor took 74.90ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 116.4MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,184 INFO L158 Benchmark]: RCFGBuilder took 553.71ms. Allocated memory is still 180.4MB. Free memory was 116.4MB in the beginning and 92.7MB in the end (delta: 23.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,184 INFO L158 Benchmark]: TraceAbstraction took 24227.60ms. Allocated memory was 180.4MB in the beginning and 903.9MB in the end (delta: 723.5MB). Free memory was 92.0MB in the beginning and 583.2MB in the end (delta: -491.2MB). Peak memory consumption was 233.6MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,185 INFO L158 Benchmark]: Witness Printer took 11.32ms. Allocated memory is still 903.9MB. Free memory was 583.2MB in the beginning and 582.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 22:17:07,187 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 180.4MB. Free memory is still 150.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.13ms. Allocated memory is still 180.4MB. Free memory was 146.7MB in the beginning and 129.8MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.42ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 124.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.90ms. Allocated memory is still 180.4MB. Free memory was 124.9MB in the beginning and 116.4MB in the end (delta: 8.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 553.71ms. Allocated memory is still 180.4MB. Free memory was 116.4MB in the beginning and 92.7MB in the end (delta: 23.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24227.60ms. Allocated memory was 180.4MB in the beginning and 903.9MB in the end (delta: 723.5MB). Free memory was 92.0MB in the beginning and 583.2MB in the end (delta: -491.2MB). Peak memory consumption was 233.6MB. Max. memory is 16.1GB. * Witness Printer took 11.32ms. Allocated memory is still 903.9MB. Free memory was 583.2MB in the beginning and 582.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = 2; [L25] signed short int var_1_4 = 256; [L26] signed short int var_1_5 = -256; [L27] signed short int var_1_6 = 2; [L28] signed long int var_1_7 = 255; [L29] signed long int var_1_8 = 127; [L30] signed long int var_1_9 = 128; [L31] signed long int var_1_10 = 499; [L32] unsigned short int var_1_11 = 10; [L33] unsigned char var_1_12 = 1; [L34] unsigned short int var_1_13 = 8; [L35] unsigned short int var_1_14 = 256; [L36] unsigned short int var_1_15 = 1; [L37] unsigned short int var_1_16 = 16; [L38] unsigned short int var_1_17 = 57705; [L39] unsigned long int var_1_18 = 64; VAL [isInitial=0, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L114] isInitial = 1 [L115] FCALL initially() [L116] COND TRUE 1 [L117] FCALL updateLastVariables() [L118] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L65] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L66] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L66] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=2, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L67] var_1_3 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_3 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L68] RET assume_abort_if_not(var_1_3 >= -16383) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L69] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L69] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=256, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L70] var_1_4 = __VERIFIER_nondet_short() [L71] CALL assume_abort_if_not(var_1_4 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L71] RET assume_abort_if_not(var_1_4 >= -8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L72] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L72] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=-256, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L73] var_1_5 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_5 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L74] RET assume_abort_if_not(var_1_5 >= -8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L75] CALL assume_abort_if_not(var_1_5 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L75] RET assume_abort_if_not(var_1_5 <= 8191) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=2, var_1_7=255, var_1_8=127, var_1_9=128] [L76] var_1_6 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L77] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L78] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L78] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=127, var_1_9=128] [L79] var_1_8 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=128] [L82] var_1_9 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=499, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L85] var_1_10 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L88] var_1_12 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=8, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L91] var_1_13 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=256, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L94] var_1_14 = __VERIFIER_nondet_ushort() [L95] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=1, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L97] var_1_15 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=16, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L100] var_1_16 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=57705, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L103] var_1_17 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=0, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L118] RET updateVariables() [L119] CALL step() [L43] COND TRUE ! var_1_2 [L44] var_1_1 = (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L48] signed short int stepLocal_0 = var_1_5; VAL [isInitial=1, stepLocal_0=4, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=255, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_0 > 2 [L50] var_1_7 = ((var_1_8 + var_1_9) - var_1_10) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=64, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L52] var_1_18 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L53] COND FALSE !(var_1_2 && var_1_12) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L56] EXPR -25 << var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L56] COND TRUE var_1_3 < (200 * (-25 << var_1_18)) [L57] var_1_11 = ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET step() [L120] CALL, EXPR property() [L110] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR -25 << var_1_18 VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110] EXPR (((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15))))) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L110-L111] return ((((! var_1_2) ? (var_1_1 == ((signed short int) (((((var_1_3 + (var_1_4 + var_1_5))) < (var_1_6)) ? ((var_1_3 + (var_1_4 + var_1_5))) : (var_1_6))))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_5 > 2) ? (var_1_7 == ((signed long int) ((var_1_8 + var_1_9) - var_1_10))) : 1)) && ((var_1_2 && var_1_12) ? (var_1_11 == ((unsigned short int) (var_1_13 + ((((((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) < (var_1_16)) ? (((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15)))) : (var_1_16)))))) : ((var_1_3 < (200 * (-25 << var_1_18))) ? (var_1_11 == ((unsigned short int) ((((((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) < 0 ) ? -(((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))) : (((((var_1_17 - 10000)) > (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14))))) ? ((var_1_17 - 10000)) : (((((var_1_15) < (var_1_14)) ? (var_1_15) : (var_1_14)))))))))) : (var_1_11 == ((unsigned short int) (var_1_17 - var_1_15)))))) && (var_1_18 == ((unsigned long int) var_1_17)) ; [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=32767, var_1_12=1, var_1_13=32767, var_1_14=32767, var_1_15=-32769, var_1_16=32767, var_1_17=2147516415, var_1_18=32767, var_1_1=-1, var_1_2=0, var_1_3=-4800, var_1_4=4795, var_1_5=4, var_1_6=32766, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 4670 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3098 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1397 IncrementalHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1572 mSDtfsCounter, 1397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 153 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2064 ConstructedInterpolants, 0 QuantifiedInterpolants, 5361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 18090/18144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:17:07,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:17:09,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:17:09,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:17:09,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:17:09,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:17:09,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:17:09,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:17:09,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:17:09,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:17:09,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:17:09,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:17:09,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:17:09,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:17:09,550 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:17:09,551 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:17:09,551 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:17:09,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:17:09,555 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:17:09,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:17:09,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:17:09,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:17:09,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:17:09,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:17:09,557 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:17:09,557 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:17:09,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:17:09,558 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:17:09,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:17:09,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:17:09,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:17:09,559 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:17:09,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:17:09,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:17:09,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:17:09,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:17:09,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:17:09,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:17:09,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:17:09,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:17:09,574 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:17:09,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:17:09,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:17:09,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:17:09,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:17:09,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 372bad28063f40745a1d198085d9dba9c573515785fed9177a01325fc4e12ae1 [2024-11-18 22:17:09,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:17:09,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:17:09,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:17:09,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:17:09,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:17:09,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:17:11,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:17:11,659 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:17:11,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:17:11,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db267ac0/1c83f13f332e4494a516367d920bb815/FLAG0f8a12038 [2024-11-18 22:17:12,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9db267ac0/1c83f13f332e4494a516367d920bb815 [2024-11-18 22:17:12,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:17:12,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:17:12,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:17:12,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:17:12,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:17:12,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72447d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12, skipping insertion in model container [2024-11-18 22:17:12,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:17:12,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i[916,929] [2024-11-18 22:17:12,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:17:12,358 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:17:12,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-86.i[916,929] [2024-11-18 22:17:12,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:17:12,433 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:17:12,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12 WrapperNode [2024-11-18 22:17:12,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:17:12,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:17:12,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:17:12,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:17:12,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,494 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-18 22:17:12,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:17:12,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:17:12,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:17:12,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:17:12,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:17:12,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:17:12,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:17:12,570 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:17:12,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:17:12,571 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (1/1) ... [2024-11-18 22:17:12,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:17:12,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:17:12,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:17:12,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:17:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:17:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 22:17:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:17:12,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:17:12,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:17:12,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:17:12,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:17:12,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:17:13,081 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-18 22:17:13,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:17:13,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:17:13,094 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:17:13,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:13 BoogieIcfgContainer [2024-11-18 22:17:13,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:17:13,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:17:13,096 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:17:13,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:17:13,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:17:12" (1/3) ... [2024-11-18 22:17:13,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1770855e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:17:13, skipping insertion in model container [2024-11-18 22:17:13,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:17:12" (2/3) ... [2024-11-18 22:17:13,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1770855e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:17:13, skipping insertion in model container [2024-11-18 22:17:13,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:17:13" (3/3) ... [2024-11-18 22:17:13,104 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-86.i [2024-11-18 22:17:13,119 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:17:13,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:17:13,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:17:13,201 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@55e7cbc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:17:13,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:17:13,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:17:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-18 22:17:13,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:13,228 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:13,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:13,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1605405134, now seen corresponding path program 1 times [2024-11-18 22:17:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:17:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952246888] [2024-11-18 22:17:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:13,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:17:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:17:13,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:17:13,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 22:17:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:13,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:17:13,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:17:13,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-18 22:17:13,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:17:13,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:17:13,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952246888] [2024-11-18 22:17:13,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952246888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:13,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:13,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 22:17:13,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19683443] [2024-11-18 22:17:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:13,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:17:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:17:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:17:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:17:13,586 INFO L87 Difference]: Start difference. First operand has 67 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 22:17:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:13,614 INFO L93 Difference]: Finished difference Result 127 states and 224 transitions. [2024-11-18 22:17:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:17:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 168 [2024-11-18 22:17:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:13,624 INFO L225 Difference]: With dead ends: 127 [2024-11-18 22:17:13,625 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 22:17:13,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:17:13,632 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:13,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:17:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 22:17:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-18 22:17:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:17:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2024-11-18 22:17:13,677 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 168 [2024-11-18 22:17:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:13,678 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2024-11-18 22:17:13,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 22:17:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2024-11-18 22:17:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-18 22:17:13,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:13,683 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:13,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:17:13,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:17:13,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:13,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:13,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1877447118, now seen corresponding path program 1 times [2024-11-18 22:17:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:17:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949938557] [2024-11-18 22:17:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:13,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:17:13,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:17:13,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:17:13,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 22:17:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:14,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 22:17:14,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:17:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-18 22:17:14,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:17:14,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 22:17:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949938557] [2024-11-18 22:17:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949938557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:17:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:17:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:17:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344157520] [2024-11-18 22:17:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:17:14,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:17:14,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 22:17:14,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:17:14,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:14,147 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:17:14,209 INFO L93 Difference]: Finished difference Result 136 states and 201 transitions. [2024-11-18 22:17:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:17:14,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 168 [2024-11-18 22:17:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:17:14,213 INFO L225 Difference]: With dead ends: 136 [2024-11-18 22:17:14,213 INFO L226 Difference]: Without dead ends: 76 [2024-11-18 22:17:14,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:17:14,215 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:17:14,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:17:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-18 22:17:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-11-18 22:17:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-18 22:17:14,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2024-11-18 22:17:14,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 168 [2024-11-18 22:17:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:17:14,240 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2024-11-18 22:17:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-18 22:17:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2024-11-18 22:17:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-18 22:17:14,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:17:14,244 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:17:14,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:17:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:17:14,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:17:14,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:17:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1737461808, now seen corresponding path program 1 times [2024-11-18 22:17:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 22:17:14,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200641301] [2024-11-18 22:17:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:17:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 22:17:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 22:17:14,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 22:17:14,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 22:17:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:17:14,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 22:17:14,576 INFO L278 TraceCheckSpWp]: Computing forward predicates...