./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:27:19,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:27:19,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:27:19,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:27:19,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:27:19,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:27:19,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:27:19,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:27:19,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:27:19,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:27:19,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:27:19,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:27:19,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:27:19,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:27:19,622 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:27:19,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:27:19,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:27:19,623 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:27:19,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:27:19,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:27:19,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:27:19,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:27:19,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:27:19,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:27:19,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:27:19,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:27:19,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:27:19,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:27:19,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:27:19,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:27:19,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:27:19,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:27:19,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:19,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:27:19,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:27:19,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:27:19,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:27:19,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:27:19,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:27:19,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:27:19,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:27:19,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:27:19,631 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 -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2024-11-08 23:27:19,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:27:19,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:27:19,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:27:19,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:27:19,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:27:19,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:21,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:27:21,523 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:27:21,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:21,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3148d0f20/6e70f625a47d47988abb840a72f6bb22/FLAG43f5c631e [2024-11-08 23:27:21,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3148d0f20/6e70f625a47d47988abb840a72f6bb22 [2024-11-08 23:27:21,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:27:21,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:27:21,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:21,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:27:21,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:27:21,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:21" (1/1) ... [2024-11-08 23:27:21,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dbaa709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:21, skipping insertion in model container [2024-11-08 23:27:21,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:21" (1/1) ... [2024-11-08 23:27:21,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:27:22,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i[916,929] [2024-11-08 23:27:22,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:22,276 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:27:22,287 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i[916,929] [2024-11-08 23:27:22,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:22,341 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:27:22,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22 WrapperNode [2024-11-08 23:27:22,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:22,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:22,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:27:22,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:27:22,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,406 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-08 23:27:22,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:22,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:27:22,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:27:22,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:27:22,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:27:22,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:27:22,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:27:22,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:27:22,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:27:22,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (1/1) ... [2024-11-08 23:27:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:22,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:22,523 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:27:22,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:27:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:27:22,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:27:22,571 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:27:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:27:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:27:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:27:22,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:27:22,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:27:23,125 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 23:27:23,126 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:27:23,142 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:27:23,142 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:27:23,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:23 BoogieIcfgContainer [2024-11-08 23:27:23,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:27:23,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:27:23,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:27:23,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:27:23,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:27:21" (1/3) ... [2024-11-08 23:27:23,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9c7903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:23, skipping insertion in model container [2024-11-08 23:27:23,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:22" (2/3) ... [2024-11-08 23:27:23,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9c7903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:23, skipping insertion in model container [2024-11-08 23:27:23,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:23" (3/3) ... [2024-11-08 23:27:23,152 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:23,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:27:23,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:27:23,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:27:23,228 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;@6051670, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:27:23,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:27:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 23:27:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:27:23,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:23,246 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:23,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:23,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1985683578, now seen corresponding path program 1 times [2024-11-08 23:27:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:23,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561854937] [2024-11-08 23:27:23,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:27:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:27:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:27:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:27:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:27:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:27:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:27:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:27:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:23,745 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 23:27:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561854937] [2024-11-08 23:27:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561854937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:23,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:23,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:27:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576719417] [2024-11-08 23:27:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:27:23,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:23,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:27:23,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:23,783 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 60 states have internal predecessors, (88), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 23:27:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:23,825 INFO L93 Difference]: Finished difference Result 159 states and 275 transitions. [2024-11-08 23:27:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:27:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 142 [2024-11-08 23:27:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:23,856 INFO L225 Difference]: With dead ends: 159 [2024-11-08 23:27:23,856 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 23:27:23,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:23,868 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:23,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 23:27:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 23:27:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 23:27:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2024-11-08 23:27:24,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 142 [2024-11-08 23:27:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:24,009 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2024-11-08 23:27:24,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 23:27:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2024-11-08 23:27:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 23:27:24,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:24,014 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:24,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:27:24,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:24,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash 829573244, now seen corresponding path program 1 times [2024-11-08 23:27:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006857500] [2024-11-08 23:27:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:27:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:27:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:27:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:27:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:27:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:27:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:27:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:27:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 23:27:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006857500] [2024-11-08 23:27:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006857500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:27:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756610387] [2024-11-08 23:27:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:24,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:27:24,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:24,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:27:24,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:27:24,346 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:24,443 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2024-11-08 23:27:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:27:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-08 23:27:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:24,446 INFO L225 Difference]: With dead ends: 192 [2024-11-08 23:27:24,446 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 23:27:24,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:27:24,450 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:24,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 239 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:27:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 23:27:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-08 23:27:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 80 states have internal predecessors, (106), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:27:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2024-11-08 23:27:24,480 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 168 transitions. Word has length 142 [2024-11-08 23:27:24,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:24,481 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 168 transitions. [2024-11-08 23:27:24,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:24,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 168 transitions. [2024-11-08 23:27:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-08 23:27:24,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:24,484 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:24,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:27:24,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:24,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1361898900, now seen corresponding path program 1 times [2024-11-08 23:27:24,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:24,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787961385] [2024-11-08 23:27:24,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:24,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:27:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:27:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:27:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:27:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:27:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:27:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:27:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:27:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:27:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:27:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:27:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:27:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 23:27:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:27:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:27:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:27:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:27:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:27:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:27:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:27:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:27:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 23:27:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787961385] [2024-11-08 23:27:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787961385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:27:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339631358] [2024-11-08 23:27:25,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:25,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:25,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:25,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:25,117 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:25,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:25,164 INFO L93 Difference]: Finished difference Result 224 states and 334 transitions. [2024-11-08 23:27:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:25,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-08 23:27:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:25,168 INFO L225 Difference]: With dead ends: 224 [2024-11-08 23:27:25,168 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 23:27:25,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:25,170 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:25,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 275 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 23:27:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-08 23:27:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 80 states have internal predecessors, (104), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 23:27:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-11-08 23:27:25,183 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 143 [2024-11-08 23:27:25,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:25,184 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-11-08 23:27:25,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-11-08 23:27:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:27:25,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:25,189 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:25,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:27:25,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1728635281, now seen corresponding path program 1 times [2024-11-08 23:27:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664715978] [2024-11-08 23:27:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:27:25,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598576998] [2024-11-08 23:27:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:25,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:25,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:25,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:27:25,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:27:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:25,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 23:27:25,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 23:27:26,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:27:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664715978] [2024-11-08 23:27:26,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:27:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598576998] [2024-11-08 23:27:26,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598576998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:26,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:26,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:27:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141904287] [2024-11-08 23:27:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:26,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:27:26,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:27:26,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:27:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:27:26,165 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:26,316 INFO L93 Difference]: Finished difference Result 326 states and 483 transitions. [2024-11-08 23:27:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:27:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 145 [2024-11-08 23:27:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:26,320 INFO L225 Difference]: With dead ends: 326 [2024-11-08 23:27:26,320 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 23:27:26,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:27:26,322 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:26,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 312 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:27:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 23:27:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 153. [2024-11-08 23:27:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 97 states have (on average 1.2577319587628866) internal successors, (122), 98 states have internal predecessors, (122), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 23:27:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 226 transitions. [2024-11-08 23:27:26,345 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 226 transitions. Word has length 145 [2024-11-08 23:27:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:26,346 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 226 transitions. [2024-11-08 23:27:26,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:27:26,346 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 226 transitions. [2024-11-08 23:27:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 23:27:26,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:26,348 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:26,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:27:26,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:26,549 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:26,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:26,550 INFO L85 PathProgramCache]: Analyzing trace with hash 760893681, now seen corresponding path program 1 times [2024-11-08 23:27:26,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:27:26,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681036681] [2024-11-08 23:27:26,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:26,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:27:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:27:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096859820] [2024-11-08 23:27:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:26,658 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:27:26,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:27:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:27:26,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:27:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:27:27,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:27:27,044 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:27:27,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:27:27,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:27:27,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:27:27,252 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 23:27:27,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:27:27,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:27:27 BoogieIcfgContainer [2024-11-08 23:27:27,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:27:27,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:27:27,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:27:27,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:27:27,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:23" (3/4) ... [2024-11-08 23:27:27,397 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:27:27,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:27:27,399 INFO L158 Benchmark]: Toolchain (without parser) took 5490.11ms. Allocated memory was 125.8MB in the beginning and 220.2MB in the end (delta: 94.4MB). Free memory was 53.6MB in the beginning and 141.5MB in the end (delta: -88.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-08 23:27:27,401 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 125.8MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:27:27,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.92ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 53.3MB in the beginning and 137.7MB in the end (delta: -84.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-08 23:27:27,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.55ms. Allocated memory is still 174.1MB. Free memory was 137.7MB in the beginning and 132.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:27:27,402 INFO L158 Benchmark]: Boogie Preprocessor took 82.17ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 125.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:27:27,402 INFO L158 Benchmark]: RCFGBuilder took 652.56ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 95.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-08 23:27:27,402 INFO L158 Benchmark]: TraceAbstraction took 4247.21ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 94.7MB in the beginning and 141.5MB in the end (delta: -46.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:27:27,403 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 220.2MB. Free memory is still 141.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:27:27,404 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.50ms. Allocated memory is still 125.8MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.92ms. Allocated memory was 125.8MB in the beginning and 174.1MB in the end (delta: 48.2MB). Free memory was 53.3MB in the beginning and 137.7MB in the end (delta: -84.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.55ms. Allocated memory is still 174.1MB. Free memory was 137.7MB in the beginning and 132.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.17ms. Allocated memory is still 174.1MB. Free memory was 132.5MB in the beginning and 125.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 652.56ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 95.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4247.21ms. Allocated memory was 174.1MB in the beginning and 220.2MB in the end (delta: 46.1MB). Free memory was 94.7MB in the beginning and 141.5MB in the end (delta: -46.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 220.2MB. Free memory is still 141.5MB. 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 190, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 100; [L23] unsigned char var_1_5 = 0; [L24] double var_1_6 = 4.5; [L25] unsigned char var_1_7 = 2; [L26] unsigned char var_1_8 = 2; [L27] double var_1_12 = 16.4; [L28] signed long int var_1_13 = 32; [L29] signed short int var_1_15 = -10; [L30] signed long int var_1_16 = -5; [L31] unsigned char var_1_17 = 1; [L32] signed short int var_1_18 = 500; [L33] double var_1_19 = 32.5; [L34] signed char var_1_20 = 0; [L35] double var_1_21 = 2.5; [L36] double var_1_22 = 0.0; [L37] double var_1_23 = 9.6; [L38] unsigned char var_1_24 = 64; [L39] unsigned char var_1_25 = 0; [L40] unsigned short int var_1_26 = 8; [L41] unsigned short int var_1_28 = 16; [L42] double var_1_29 = 200.5; [L43] unsigned short int var_1_30 = 20701; [L44] double last_1_var_1_6 = 4.5; [L45] signed long int last_1_var_1_16 = -5; [L46] signed short int last_1_var_1_18 = 500; [L47] signed char last_1_var_1_20 = 0; [L48] double last_1_var_1_21 = 2.5; [L49] unsigned char last_1_var_1_24 = 64; [L50] unsigned short int last_1_var_1_26 = 8; [L51] unsigned short int last_1_var_1_28 = 16; VAL [isInitial=0, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L180] last_1_var_1_6 = var_1_6 [L181] last_1_var_1_16 = var_1_16 [L182] last_1_var_1_18 = var_1_18 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_21 = var_1_21 [L185] last_1_var_1_24 = var_1_24 [L186] last_1_var_1_26 = var_1_26 [L187] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L147] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L148] var_1_7 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L149] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_8=2] [L150] CALL assume_abort_if_not(var_1_7 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L150] RET assume_abort_if_not(var_1_7 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=2] [L151] var_1_8 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L152] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2] [L153] CALL assume_abort_if_not(var_1_8 <= 23) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L153] RET assume_abort_if_not(var_1_8 <= 23) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=82/5, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-10, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L156] var_1_15 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L157] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L158] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L159] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=1, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L161] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_19=65/2, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854776000e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_22=0, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L165] var_1_22 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L166] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_23=48/5, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L167] var_1_23 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L168] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L169] var_1_25 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L171] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_29=401/2, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L172] var_1_29 = __VERIFIER_nondet_double() [L173] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L173] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L174] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=20701, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L175] var_1_30 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_30 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L176] RET assume_abort_if_not(var_1_30 >= 16383) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L177] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L198] RET updateVariables() [L199] CALL step() [L55] unsigned char stepLocal_0 = ! var_1_5; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_0=1, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=100, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L56] COND FALSE !(((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && stepLocal_0) [L59] var_1_1 = last_1_var_1_26 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L61] signed long int stepLocal_1 = (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))); [L62] COND FALSE !(last_1_var_1_18 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L69] signed long int stepLocal_3 = last_1_var_1_26 + var_1_8; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L70] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=5/2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L81] COND TRUE ! (last_1_var_1_18 <= (var_1_7 / var_1_15)) [L82] var_1_21 = ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=64, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L86] COND FALSE !(var_1_17 || (var_1_8 >= last_1_var_1_24)) [L91] var_1_24 = var_1_7 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L93] COND FALSE !(var_1_19 == var_1_21) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-5, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L100] COND FALSE !(var_1_5 && var_1_17) [L103] var_1_16 = (var_1_8 - var_1_7) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L105] unsigned char stepLocal_2 = var_1_24; VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=32, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L106] COND TRUE var_1_21 > var_1_21 [L107] var_1_13 = (var_1_7 - var_1_24) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=16, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L115] COND FALSE !(\read(var_1_17)) [L122] var_1_28 = var_1_1 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L124] COND TRUE ! var_1_17 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=8, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L125] COND FALSE !(\read(var_1_17)) [L138] var_1_26 = var_1_18 VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, stepLocal_2=2, stepLocal_3=8, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR (last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190] EXPR ((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L190-L191] return ((((((((((((last_1_var_1_26 * last_1_var_1_20) >= last_1_var_1_28) && (! var_1_5)) ? (var_1_1 == ((signed short int) last_1_var_1_26)) : (var_1_1 == ((signed short int) last_1_var_1_26))) && ((last_1_var_1_18 <= ((last_1_var_1_24 - last_1_var_1_28) << ((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (((- last_1_var_1_21) > (last_1_var_1_6 + (- last_1_var_1_21))) ? (var_1_6 == ((double) var_1_12)) : (var_1_6 == ((double) var_1_12))) : 1)) && ((var_1_21 > var_1_21) ? (var_1_13 == ((signed long int) (var_1_7 - var_1_24))) : (((var_1_16 / var_1_15) < var_1_24) ? (var_1_13 == ((signed long int) var_1_7)) : (var_1_13 == ((signed long int) var_1_15))))) && ((var_1_5 && var_1_17) ? (var_1_16 == ((signed long int) ((((last_1_var_1_16) > (var_1_15)) ? (last_1_var_1_16) : (var_1_15))))) : (var_1_16 == ((signed long int) (var_1_8 - var_1_7))))) && (var_1_5 ? ((((((last_1_var_1_6) < ((1.0000000075E8 - var_1_19))) ? (last_1_var_1_6) : ((1.0000000075E8 - var_1_19)))) > var_1_12) ? (((last_1_var_1_26 + var_1_8) >= last_1_var_1_24) ? (var_1_18 == ((signed short int) var_1_7)) : (var_1_18 == ((signed short int) last_1_var_1_24))) : (var_1_18 == ((signed short int) var_1_8))) : 1)) && ((var_1_19 == var_1_21) ? ((! var_1_17) ? (var_1_20 == ((signed char) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) : (var_1_20 == ((signed char) var_1_7))) : 1)) && ((! (last_1_var_1_18 <= (var_1_7 / var_1_15))) ? (var_1_21 == ((double) ((((((var_1_22 - 7.5) - var_1_23)) > (var_1_12)) ? (((var_1_22 - 7.5) - var_1_23)) : (var_1_12))))) : (var_1_21 == ((double) var_1_22)))) && ((var_1_17 || (var_1_8 >= last_1_var_1_24)) ? ((var_1_17 && (var_1_21 != var_1_23)) ? (var_1_24 == ((unsigned char) ((((var_1_7) < (var_1_25)) ? (var_1_7) : (var_1_25))))) : 1) : (var_1_24 == ((unsigned char) var_1_7)))) && ((! var_1_17) ? (var_1_17 ? ((var_1_6 <= ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) ? ((var_1_19 <= ((var_1_12 + var_1_6) / var_1_22)) ? (((~ var_1_24) > var_1_1) ? (var_1_26 == ((unsigned short int) var_1_13)) : (var_1_26 == ((unsigned short int) var_1_7))) : 1) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_18))) : (var_1_26 == ((unsigned short int) var_1_8)))) && (var_1_17 ? ((var_1_21 <= ((var_1_6 / var_1_22) + (var_1_21 / var_1_29))) ? (var_1_28 == ((unsigned short int) ((59265 - ((((var_1_8) > (var_1_18)) ? (var_1_8) : (var_1_18)))) - (var_1_30 - var_1_13)))) : (var_1_28 == ((unsigned short int) var_1_13))) : (var_1_28 == ((unsigned short int) var_1_1))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=-5, last_1_var_1_18=500, last_1_var_1_20=0, last_1_var_1_21=5/2, last_1_var_1_24=64, last_1_var_1_26=8, last_1_var_1_28=16, last_1_var_1_6=9/2, var_1_12=0, var_1_13=0, var_1_15=-1, var_1_16=-2, var_1_17=0, var_1_18=500, var_1_1=8, var_1_20=0, var_1_21=2, var_1_24=2, var_1_25=0, var_1_26=500, var_1_28=8, var_1_30=16383, var_1_5=0, var_1_6=9/2, var_1_7=2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 5, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 949 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 481 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 67 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1007 NumberOfCodeBlocks, 1007 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 5 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3360/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 23:27:27,444 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.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 b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:27:29,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:27:29,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:27:29,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:27:29,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:27:29,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:27:29,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:27:29,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:27:29,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:27:29,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:27:29,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:27:29,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:27:29,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:27:29,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:27:29,766 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:27:29,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:27:29,767 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:27:29,767 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:27:29,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:27:29,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:27:29,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:27:29,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:27:29,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:27:29,770 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:27:29,770 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:27:29,771 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:27:29,771 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:27:29,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:27:29,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:27:29,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:27:29,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:27:29,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:27:29,772 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:27:29,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:27:29,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:29,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:27:29,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:27:29,774 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:27:29,774 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:27:29,774 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:27:29,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:27:29,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:27:29,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:27:29,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:27:29,776 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 -> b91ebd1689e4194b5d79759535cd76cf95d0d89593ded7ad5125fdaefe13f43a [2024-11-08 23:27:30,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:27:30,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:27:30,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:27:30,148 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:27:30,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:27:30,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:31,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:27:31,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:27:31,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:31,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c80997f1/a454f55f5bc2449abbcb5b32974545bc/FLAGd0f994ef3 [2024-11-08 23:27:31,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c80997f1/a454f55f5bc2449abbcb5b32974545bc [2024-11-08 23:27:32,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:27:32,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:27:32,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:32,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:27:32,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:27:32,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:31" (1/1) ... [2024-11-08 23:27:32,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6883e194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32, skipping insertion in model container [2024-11-08 23:27:32,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:27:31" (1/1) ... [2024-11-08 23:27:32,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:27:32,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i[916,929] [2024-11-08 23:27:32,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:32,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:27:32,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-12.i[916,929] [2024-11-08 23:27:32,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:27:32,436 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:27:32,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32 WrapperNode [2024-11-08 23:27:32,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:27:32,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:32,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:27:32,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:27:32,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,500 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-08 23:27:32,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:27:32,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:27:32,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:27:32,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:27:32,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,551 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 23:27:32,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:27:32,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:27:32,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:27:32,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:27:32,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (1/1) ... [2024-11-08 23:27:32,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:27:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:27:32,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:27:32,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:27:32,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:27:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:27:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:27:32,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:27:32,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:27:32,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:27:32,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:27:32,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:27:57,384 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:27:57,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:27:57,398 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:27:57,398 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:27:57,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:57 BoogieIcfgContainer [2024-11-08 23:27:57,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:27:57,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:27:57,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:27:57,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:27:57,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:27:31" (1/3) ... [2024-11-08 23:27:57,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c5c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:57, skipping insertion in model container [2024-11-08 23:27:57,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:27:32" (2/3) ... [2024-11-08 23:27:57,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224c5c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:27:57, skipping insertion in model container [2024-11-08 23:27:57,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:27:57" (3/3) ... [2024-11-08 23:27:57,409 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-12.i [2024-11-08 23:27:57,425 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:27:57,425 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:27:57,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:27:57,488 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;@598cdd6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:27:57,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:27:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 23:27:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 23:27:57,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:57,507 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:57,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash 426080427, now seen corresponding path program 1 times [2024-11-08 23:27:57,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693157470] [2024-11-08 23:27:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:57,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:57,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:57,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 23:27:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:27:59,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:27:59,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-08 23:27:59,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:27:59,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:27:59,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693157470] [2024-11-08 23:27:59,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693157470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:27:59,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:27:59,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:27:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094861384] [2024-11-08 23:27:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:27:59,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:27:59,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:27:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:27:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:59,162 INFO L87 Difference]: Start difference. First operand has 76 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 23:27:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:27:59,203 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-11-08 23:27:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:27:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2024-11-08 23:27:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:27:59,215 INFO L225 Difference]: With dead ends: 145 [2024-11-08 23:27:59,216 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 23:27:59,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:27:59,225 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:27:59,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:27:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 23:27:59,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 23:27:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 23:27:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 112 transitions. [2024-11-08 23:27:59,278 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 112 transitions. Word has length 139 [2024-11-08 23:27:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:27:59,278 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 112 transitions. [2024-11-08 23:27:59,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 23:27:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 112 transitions. [2024-11-08 23:27:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 23:27:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:27:59,288 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:27:59,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:27:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:59,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:27:59,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:27:59,492 INFO L85 PathProgramCache]: Analyzing trace with hash -896830403, now seen corresponding path program 1 times [2024-11-08 23:27:59,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:27:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381359907] [2024-11-08 23:27:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:27:59,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 23:27:59,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:27:59,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 23:27:59,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 23:28:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:28:01,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:28:01,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:28:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 23:28:17,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:28:17,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:28:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381359907] [2024-11-08 23:28:17,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381359907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:28:17,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:28:17,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:28:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235447845] [2024-11-08 23:28:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:28:17,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:28:17,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:28:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:28:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:28:17,039 INFO L87 Difference]: Start difference. First operand 72 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 23:28:22,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:26,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:31,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:35,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:40,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:44,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:28:49,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []