./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:15:42,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:15:42,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:15:42,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:15:42,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:15:42,609 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:15:42,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:15:42,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:15:42,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:15:42,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:15:42,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:15:42,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:15:42,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:15:42,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:15:42,613 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:15:42,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:15:42,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:15:42,614 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:15:42,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:15:42,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:15:42,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:15:42,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:15:42,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:15:42,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:15:42,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:15:42,617 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:15:42,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:15:42,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:15:42,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:15:42,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:15:42,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:15:42,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:15:42,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:42,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:15:42,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:15:42,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:15:42,620 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:15:42,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:15:42,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:15:42,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:15:42,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:15:42,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:15:42,621 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2024-10-13 00:15:42,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:15:42,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:15:42,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:15:42,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:15:42,865 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:15:42,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-13 00:15:44,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:15:44,597 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:15:44,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-13 00:15:44,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57008bd4/f4fcc3a9b46c44109549e78aff1a444e/FLAG36d3359e2 [2024-10-13 00:15:44,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57008bd4/f4fcc3a9b46c44109549e78aff1a444e [2024-10-13 00:15:44,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:15:44,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:15:44,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:44,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:15:44,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:15:44,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:44" (1/1) ... [2024-10-13 00:15:44,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13aa0545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:44, skipping insertion in model container [2024-10-13 00:15:44,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:44" (1/1) ... [2024-10-13 00:15:44,986 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:15:45,109 WARN L248 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_codestructure_steplocals_file-63.i[917,930] [2024-10-13 00:15:45,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:45,170 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:15:45,181 WARN L248 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_codestructure_steplocals_file-63.i[917,930] [2024-10-13 00:15:45,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:45,227 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:15:45,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45 WrapperNode [2024-10-13 00:15:45,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:45,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:45,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:15:45,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:15:45,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,281 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-13 00:15:45,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:45,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:15:45,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:15:45,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:15:45,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,345 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-10-13 00:15:45,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:15:45,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:15:45,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:15:45,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:15:45,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (1/1) ... [2024-10-13 00:15:45,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:45,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-10-13 00:15:45,424 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-10-13 00:15:45,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:15:45,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:15:45,461 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:15:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:15:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:15:45,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:15:45,545 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:15:45,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:15:45,888 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-13 00:15:45,888 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:15:45,919 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:15:45,920 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:15:45,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:45 BoogieIcfgContainer [2024-10-13 00:15:45,920 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:15:45,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:15:45,922 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:15:45,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:15:45,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:44" (1/3) ... [2024-10-13 00:15:45,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504f6656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:45, skipping insertion in model container [2024-10-13 00:15:45,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:45" (2/3) ... [2024-10-13 00:15:45,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504f6656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:15:45, skipping insertion in model container [2024-10-13 00:15:45,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:45" (3/3) ... [2024-10-13 00:15:45,930 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-10-13 00:15:45,943 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:15:45,944 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:15:46,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:15:46,011 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;@5bcfae49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:15:46,011 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:15:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:15:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 00:15:46,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:46,031 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:46,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:46,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1546095273, now seen corresponding path program 1 times [2024-10-13 00:15:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463448103] [2024-10-13 00:15:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463448103] [2024-10-13 00:15:46,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463448103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:46,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:15:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843563501] [2024-10-13 00:15:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:46,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:15:46,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:46,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:15:46,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:15:46,504 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 00:15:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:46,558 INFO L93 Difference]: Finished difference Result 189 states and 334 transitions. [2024-10-13 00:15:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:15:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2024-10-13 00:15:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:46,573 INFO L225 Difference]: With dead ends: 189 [2024-10-13 00:15:46,574 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 00:15:46,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-10-13 00:15:46,584 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:46,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:15:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 00:15:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-13 00:15:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:15:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2024-10-13 00:15:46,634 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 222 [2024-10-13 00:15:46,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:46,635 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2024-10-13 00:15:46,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 00:15:46,635 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-10-13 00:15:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 00:15:46,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:46,640 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:46,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:15:46,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:46,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:46,641 INFO L85 PathProgramCache]: Analyzing trace with hash 31687901, now seen corresponding path program 1 times [2024-10-13 00:15:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686410958] [2024-10-13 00:15:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:47,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686410958] [2024-10-13 00:15:47,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686410958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:47,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:47,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:15:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891819633] [2024-10-13 00:15:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:47,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:15:47,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:47,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:15:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:15:47,166 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:47,238 INFO L93 Difference]: Finished difference Result 232 states and 354 transitions. [2024-10-13 00:15:47,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:15:47,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-13 00:15:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:47,241 INFO L225 Difference]: With dead ends: 232 [2024-10-13 00:15:47,242 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 00:15:47,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-10-13 00:15:47,246 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 60 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:47,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:15:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 00:15:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-10-13 00:15:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 00:15:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2024-10-13 00:15:47,274 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 222 [2024-10-13 00:15:47,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:47,275 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2024-10-13 00:15:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2024-10-13 00:15:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 00:15:47,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:47,282 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:15:47,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:47,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 289853339, now seen corresponding path program 1 times [2024-10-13 00:15:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146061841] [2024-10-13 00:15:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146061841] [2024-10-13 00:15:47,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146061841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:47,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:47,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:15:47,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559736325] [2024-10-13 00:15:47,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:47,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:15:47,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:47,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:15:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:15:47,444 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:47,504 INFO L93 Difference]: Finished difference Result 285 states and 425 transitions. [2024-10-13 00:15:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:15:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-13 00:15:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:47,509 INFO L225 Difference]: With dead ends: 285 [2024-10-13 00:15:47,511 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 00:15:47,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-10-13 00:15:47,513 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:47,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 278 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:15:47,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 00:15:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2024-10-13 00:15:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:15:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-10-13 00:15:47,533 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 222 [2024-10-13 00:15:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:47,534 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-13 00:15:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2024-10-13 00:15:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-13 00:15:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:47,539 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:15:47,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -519493287, now seen corresponding path program 1 times [2024-10-13 00:15:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951299990] [2024-10-13 00:15:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:48,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951299990] [2024-10-13 00:15:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951299990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 00:15:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552028827] [2024-10-13 00:15:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:48,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 00:15:48,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 00:15:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:15:48,109 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:48,278 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-10-13 00:15:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 00:15:48,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-13 00:15:48,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:48,280 INFO L225 Difference]: With dead ends: 270 [2024-10-13 00:15:48,281 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 00:15:48,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 00:15:48,282 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:48,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 621 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:15:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 00:15:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-10-13 00:15:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 00:15:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-10-13 00:15:48,293 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 222 [2024-10-13 00:15:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:48,293 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-10-13 00:15:48,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-10-13 00:15:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 00:15:48,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:48,296 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:48,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:15:48,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:48,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:48,296 INFO L85 PathProgramCache]: Analyzing trace with hash -34645832, now seen corresponding path program 1 times [2024-10-13 00:15:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:48,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816702612] [2024-10-13 00:15:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816702612] [2024-10-13 00:15:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816702612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:48,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:48,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 00:15:48,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167303959] [2024-10-13 00:15:48,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:48,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 00:15:48,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:48,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 00:15:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 00:15:48,870 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:49,205 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2024-10-13 00:15:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 00:15:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-13 00:15:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:49,209 INFO L225 Difference]: With dead ends: 385 [2024-10-13 00:15:49,210 INFO L226 Difference]: Without dead ends: 234 [2024-10-13 00:15:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:15:49,212 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 81 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:49,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 807 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 00:15:49,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-13 00:15:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-10-13 00:15:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.344155844155844) internal successors, (207), 155 states have internal predecessors, (207), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 00:15:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-10-13 00:15:49,240 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 223 [2024-10-13 00:15:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:49,244 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-10-13 00:15:49,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-10-13 00:15:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-13 00:15:49,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:49,248 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 00:15:49,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1151587566, now seen corresponding path program 1 times [2024-10-13 00:15:49,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716252283] [2024-10-13 00:15:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:15:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:15:49,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:15:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:15:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:15:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:15:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:15:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:15:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:15:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:15:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:15:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:15:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:15:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:15:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:15:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:15:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:15:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:15:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:15:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:15:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:15:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:15:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:15:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:15:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:15:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:15:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:15:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 00:15:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 00:15:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-13 00:15:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-13 00:15:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-13 00:15:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-13 00:15:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-13 00:15:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-13 00:15:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 00:15:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:15:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:15:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:15:49,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716252283] [2024-10-13 00:15:49,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716252283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:15:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:15:49,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:15:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752861883] [2024-10-13 00:15:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:15:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:15:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:15:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:15:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:15:49,455 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:15:49,496 INFO L93 Difference]: Finished difference Result 432 states and 620 transitions. [2024-10-13 00:15:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:15:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-13 00:15:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:15:49,498 INFO L225 Difference]: With dead ends: 432 [2024-10-13 00:15:49,498 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 00:15:49,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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-10-13 00:15:49,500 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 30 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:15:49,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:15:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 00:15:49,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 218. [2024-10-13 00:15:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.3465909090909092) internal successors, (237), 177 states have internal predecessors, (237), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 00:15:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-10-13 00:15:49,519 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 223 [2024-10-13 00:15:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:15:49,519 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-10-13 00:15:49,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:15:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-10-13 00:15:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-13 00:15:49,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:15:49,522 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:15:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 00:15:49,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:15:49,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:15:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1409506018, now seen corresponding path program 1 times [2024-10-13 00:15:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:15:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248229252] [2024-10-13 00:15:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:15:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:15:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:15:49,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:15:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:15:49,788 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:15:49,790 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:15:49,790 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:15:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 00:15:49,795 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:15:49,914 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:15:49,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:15:49 BoogieIcfgContainer [2024-10-13 00:15:49,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:15:49,918 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:15:49,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:15:49,919 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:15:49,919 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:15:45" (3/4) ... [2024-10-13 00:15:49,921 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:15:49,922 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:15:49,922 INFO L158 Benchmark]: Toolchain (without parser) took 4973.12ms. Allocated memory was 157.3MB in the beginning and 323.0MB in the end (delta: 165.7MB). Free memory was 85.2MB in the beginning and 104.6MB in the end (delta: -19.4MB). Peak memory consumption was 148.6MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,923 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 109.4MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:15:49,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 68.9MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.61ms. Allocated memory is still 157.3MB. Free memory was 68.9MB in the beginning and 65.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,923 INFO L158 Benchmark]: Boogie Preprocessor took 91.87ms. Allocated memory is still 157.3MB. Free memory was 65.6MB in the beginning and 61.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,923 INFO L158 Benchmark]: RCFGBuilder took 545.18ms. Allocated memory was 157.3MB in the beginning and 253.8MB in the end (delta: 96.5MB). Free memory was 61.1MB in the beginning and 204.3MB in the end (delta: -143.2MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,925 INFO L158 Benchmark]: TraceAbstraction took 3996.18ms. Allocated memory was 253.8MB in the beginning and 323.0MB in the end (delta: 69.2MB). Free memory was 203.3MB in the beginning and 104.6MB in the end (delta: 98.7MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. [2024-10-13 00:15:49,925 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 323.0MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:15:49,926 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.14ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 109.4MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.38ms. Allocated memory is still 157.3MB. Free memory was 84.9MB in the beginning and 68.9MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.61ms. Allocated memory is still 157.3MB. Free memory was 68.9MB in the beginning and 65.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.87ms. Allocated memory is still 157.3MB. Free memory was 65.6MB in the beginning and 61.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 545.18ms. Allocated memory was 157.3MB in the beginning and 253.8MB in the end (delta: 96.5MB). Free memory was 61.1MB in the beginning and 204.3MB in the end (delta: -143.2MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3996.18ms. Allocated memory was 253.8MB in the beginning and 323.0MB in the end (delta: 69.2MB). Free memory was 203.3MB in the beginning and 104.6MB in the end (delta: 98.7MB). Peak memory consumption was 167.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 323.0MB. Free memory is still 104.6MB. There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 160. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 50; [L24] unsigned long int var_1_3 = 8; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = -100; [L27] signed long int var_1_6 = 8; [L28] unsigned char var_1_7 = 0; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 128; [L32] unsigned short int var_1_11 = 500; [L33] unsigned short int var_1_12 = 128; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 8; [L37] double var_1_17 = 7.5; [L38] double var_1_18 = 31.125; [L39] double var_1_19 = 10.5; [L40] double var_1_20 = 0.0; [L41] double var_1_21 = 16.75; [L42] double var_1_22 = 2.5; [L43] double var_1_23 = 64.5; [L44] signed long int var_1_24 = 10; [L45] signed long int var_1_25 = -64; [L46] signed char var_1_26 = 16; [L47] signed char var_1_27 = 4; [L48] signed char var_1_28 = -10; [L49] float var_1_29 = 63.794; [L50] unsigned short int var_1_30 = 1; [L51] signed long int var_1_31 = -2; [L52] unsigned char var_1_32 = 64; [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] FCALL updateLastVariables() [L168] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L102] var_1_3 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L106] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L108] var_1_5 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L109] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_5 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] RET assume_abort_if_not(var_1_5 <= 536870912) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L111] var_1_6 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_6 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L112] RET assume_abort_if_not(var_1_6 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_6 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L113] RET assume_abort_if_not(var_1_6 <= 536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L114] var_1_7 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L115] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L116] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L118] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L119] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L120] var_1_9 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L121] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L122] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L122] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L123] var_1_10 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L125] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L125] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L126] var_1_12 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L127] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L128] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L128] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L132] var_1_16 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L134] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L134] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L138] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L140] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L141] var_1_21 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L142] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L143] var_1_22 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L144] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L145] var_1_23 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L146] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L147] var_1_25 = __VERIFIER_nondet_long() [L148] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L148] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L149] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L149] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L150] var_1_27 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L151] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L152] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L152] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L153] var_1_28 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L154] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L155] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L155] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L168] RET updateVariables() [L169] CALL step() [L56] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L56] COND TRUE 32u < ((var_1_2 + 4u) | var_1_3) [L57] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L65] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L65] signed long int stepLocal_0 = var_1_9 >> var_1_4; [L66] COND TRUE stepLocal_0 < var_1_1 [L67] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L69] unsigned short int stepLocal_1 = var_1_11; VAL [isInitial=1, stepLocal_1=505, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L70] COND TRUE var_1_2 != stepLocal_1 [L71] var_1_13 = ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L73] COND FALSE !(\read(var_1_7)) [L76] var_1_17 = var_1_22 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L78] signed long int stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L79] COND TRUE ! var_1_7 [L80] var_1_24 = (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L88] COND TRUE var_1_8 >= var_1_1 [L89] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L91] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L94] var_1_30 = var_1_12 [L95] var_1_31 = var_1_25 [L96] var_1_32 = var_1_16 [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160-L161] return ((((((((((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1)) && ((var_1_2 != var_1_11) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))))) : ((var_1_10 < var_1_9) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_25))))) && ((var_1_8 >= var_1_1) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_12))) && (var_1_31 == ((signed long int) var_1_25))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 2448 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1515 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 933 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 97 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1558 NumberOfCodeBlocks, 1558 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15120/15120 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-10-13 00:15:49,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:15:51,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:15:52,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:15:52,054 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:15:52,055 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:15:52,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:15:52,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:15:52,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:15:52,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:15:52,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:15:52,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:15:52,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:15:52,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:15:52,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:15:52,086 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:15:52,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:15:52,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:15:52,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:15:52,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:15:52,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:15:52,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:15:52,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:15:52,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:15:52,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:15:52,091 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:15:52,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:15:52,091 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:15:52,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:15:52,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:15:52,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:15:52,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:15:52,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:15:52,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:15:52,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:15:52,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:52,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:15:52,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:15:52,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:15:52,094 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:15:52,094 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:15:52,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:15:52,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:15:52,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:15:52,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:15:52,095 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:15:52,096 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2024-10-13 00:15:52,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:15:52,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:15:52,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:15:52,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:15:52,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:15:52,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-13 00:15:53,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:15:54,153 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:15:54,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-13 00:15:54,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebbbc356/344759efd5e14fe7b35ba046cf8a0247/FLAG8be7480d2 [2024-10-13 00:15:54,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebbbc356/344759efd5e14fe7b35ba046cf8a0247 [2024-10-13 00:15:54,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:15:54,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:15:54,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:54,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:15:54,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:15:54,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166db7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54, skipping insertion in model container [2024-10-13 00:15:54,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:15:54,431 WARN L248 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_codestructure_steplocals_file-63.i[917,930] [2024-10-13 00:15:54,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:54,534 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:15:54,549 WARN L248 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_codestructure_steplocals_file-63.i[917,930] [2024-10-13 00:15:54,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:15:54,624 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:15:54,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54 WrapperNode [2024-10-13 00:15:54,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:15:54,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:54,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:15:54,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:15:54,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,691 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-13 00:15:54,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:15:54,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:15:54,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:15:54,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:15:54,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,730 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-10-13 00:15:54,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:15:54,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:15:54,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:15:54,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:15:54,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (1/1) ... [2024-10-13 00:15:54,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:15:54,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:15:54,779 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-10-13 00:15:54,781 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-10-13 00:15:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:15:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:15:54,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:15:54,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:15:54,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:15:54,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:15:54,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:15:54,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:16:01,983 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:16:01,983 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:16:02,034 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:16:02,035 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:16:02,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:02 BoogieIcfgContainer [2024-10-13 00:16:02,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:16:02,037 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:16:02,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:16:02,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:16:02,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:15:54" (1/3) ... [2024-10-13 00:16:02,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:16:02, skipping insertion in model container [2024-10-13 00:16:02,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:15:54" (2/3) ... [2024-10-13 00:16:02,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d83d522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:16:02, skipping insertion in model container [2024-10-13 00:16:02,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:16:02" (3/3) ... [2024-10-13 00:16:02,043 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-10-13 00:16:02,056 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:16:02,056 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:16:02,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:16:02,110 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;@78bb31db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:16:02,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:16:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:16:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 00:16:02,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:16:02,129 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:16:02,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:16:02,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:16:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash 211713354, now seen corresponding path program 1 times [2024-10-13 00:16:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:16:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466165884] [2024-10-13 00:16:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:16:02,147 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-10-13 00:16:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:16:02,151 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-10-13 00:16:02,155 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-10-13 00:16:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:16:02,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:16:02,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:16:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-13 00:16:02,630 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:16:02,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:16:02,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466165884] [2024-10-13 00:16:02,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466165884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:16:02,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:16:02,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:16:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812551733] [2024-10-13 00:16:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:16:02,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:16:02,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:16:02,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:16:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:16:02,658 INFO L87 Difference]: Start difference. First operand has 82 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 00:16:06,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:16:06,786 INFO L93 Difference]: Finished difference Result 161 states and 292 transitions. [2024-10-13 00:16:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:16:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 216 [2024-10-13 00:16:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:16:06,821 INFO L225 Difference]: With dead ends: 161 [2024-10-13 00:16:06,821 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 00:16:06,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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-10-13 00:16:06,826 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:16:06,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 00:16:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 00:16:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 00:16:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:16:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 124 transitions. [2024-10-13 00:16:06,866 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 124 transitions. Word has length 216 [2024-10-13 00:16:06,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:16:06,866 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 124 transitions. [2024-10-13 00:16:06,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-13 00:16:06,866 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 124 transitions. [2024-10-13 00:16:06,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 00:16:06,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:16:06,869 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:16:06,883 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-10-13 00:16:07,073 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-10-13 00:16:07,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:16:07,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:16:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash -996200834, now seen corresponding path program 1 times [2024-10-13 00:16:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:16:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004427754] [2024-10-13 00:16:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:16:07,079 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-10-13 00:16:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:16:07,081 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-10-13 00:16:07,087 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-10-13 00:16:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:16:07,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:16:07,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:16:07,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:16:07,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:16:07,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:16:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004427754] [2024-10-13 00:16:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004427754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:16:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:16:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:16:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814908650] [2024-10-13 00:16:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:16:07,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:16:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:16:07,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:16:07,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:16:07,500 INFO L87 Difference]: Start difference. First operand 80 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:16:10,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:13,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:13,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:16:13,743 INFO L93 Difference]: Finished difference Result 193 states and 296 transitions. [2024-10-13 00:16:13,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:16:13,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 216 [2024-10-13 00:16:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:16:13,747 INFO L225 Difference]: With dead ends: 193 [2024-10-13 00:16:13,747 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 00:16:13,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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-10-13 00:16:13,749 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:16:13,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 264 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-13 00:16:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 00:16:13,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-10-13 00:16:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 63 states have internal predecessors, (76), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 00:16:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2024-10-13 00:16:13,764 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 216 [2024-10-13 00:16:13,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:16:13,765 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2024-10-13 00:16:13,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:16:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2024-10-13 00:16:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 00:16:13,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:16:13,768 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:16:13,782 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-10-13 00:16:13,968 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-10-13 00:16:13,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:16:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:16:13,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1805547460, now seen corresponding path program 1 times [2024-10-13 00:16:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:16:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016110712] [2024-10-13 00:16:13,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:16:13,972 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-10-13 00:16:13,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:16:13,975 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-10-13 00:16:13,976 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-10-13 00:16:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:16:14,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:16:14,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:16:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-13 00:16:14,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:16:14,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:16:14,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016110712] [2024-10-13 00:16:14,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016110712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:16:14,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:16:14,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:16:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477029293] [2024-10-13 00:16:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:16:14,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:16:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:16:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:16:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:16:14,333 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:16:15,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:20,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:16:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:16:21,614 INFO L93 Difference]: Finished difference Result 233 states and 348 transitions. [2024-10-13 00:16:21,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:16:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 216 [2024-10-13 00:16:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:16:21,617 INFO L225 Difference]: With dead ends: 233 [2024-10-13 00:16:21,617 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 00:16:21,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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-10-13 00:16:21,618 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:16:21,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 236 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2024-10-13 00:16:21,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 00:16:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-10-13 00:16:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 00:16:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-13 00:16:21,628 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 216 [2024-10-13 00:16:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:16:21,639 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-13 00:16:21,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-13 00:16:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-13 00:16:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 00:16:21,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:16:21,642 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:16:21,661 INFO L552 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)] Ended with exit code 0 [2024-10-13 00:16:21,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-13 00:16:21,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:16:21,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:16:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1805487878, now seen corresponding path program 1 times [2024-10-13 00:16:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:16:21,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790695863] [2024-10-13 00:16:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:16:21,849 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-10-13 00:16:21,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:16:21,852 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-13 00:16:21,856 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 (5)] Waiting until timeout for monitored process [2024-10-13 00:16:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:16:22,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 00:16:22,254 INFO L278 TraceCheckSpWp]: Computing forward predicates...