./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.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 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:56:53,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:56:53,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:56:53,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:56:53,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:56:53,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:56:53,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:56:53,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:56:53,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:56:53,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:56:53,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:56:53,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:56:53,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:56:53,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:56:53,600 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:56:53,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:56:53,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:56:53,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:56:53,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:56:53,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:56:53,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:56:53,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:56:53,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:56:53,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:56:53,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:56:53,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:56:53,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:56:53,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:56:53,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:56:53,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:56:53,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:56:53,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:56:53,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:56:53,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:56:53,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:56:53,605 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:56:53,605 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:56:53,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:56:53,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:56:53,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:56:53,608 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:56:53,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:56:53,609 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 -> 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 [2024-10-14 11:56:53,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:56:53,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:56:53,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:56:53,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:56:53,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:56:53,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:56:55,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:56:55,692 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:56:55,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:56:55,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a489c4ef/92cadf0046ce46419db44bfced0e4c2d/FLAG33e2a02c9 [2024-10-14 11:56:56,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a489c4ef/92cadf0046ce46419db44bfced0e4c2d [2024-10-14 11:56:56,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:56:56,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:56:56,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:56:56,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:56:56,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:56:56,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e52c525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56, skipping insertion in model container [2024-10-14 11:56:56,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:56:56,299 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-14 11:56:56,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:56:56,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:56:56,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-14 11:56:56,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:56:56,489 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:56:56,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56 WrapperNode [2024-10-14 11:56:56,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:56:56,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:56:56,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:56:56,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:56:56,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,553 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-10-14 11:56:56,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:56:56,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:56:56,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:56:56,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:56:56,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,596 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:56:56,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:56:56,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:56:56,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:56:56,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:56:56,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (1/1) ... [2024-10-14 11:56:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:56:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:56:56,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:56:56,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:56:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:56:56,720 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:56:56,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:56:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:56:56,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:56:56,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:56:56,832 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:56:56,835 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:56:57,187 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-14 11:56:57,188 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:56:57,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:56:57,284 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:56:57,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:57 BoogieIcfgContainer [2024-10-14 11:56:57,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:56:57,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:56:57,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:56:57,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:56:57,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:56:56" (1/3) ... [2024-10-14 11:56:57,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264744e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:57, skipping insertion in model container [2024-10-14 11:56:57,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:56:56" (2/3) ... [2024-10-14 11:56:57,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264744e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:56:57, skipping insertion in model container [2024-10-14 11:56:57,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:57" (3/3) ... [2024-10-14 11:56:57,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:56:57,339 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:56:57,339 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:56:57,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:56:57,415 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;@67b16017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:56:57,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:56:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:56:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 11:56:57,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:56:57,435 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:56:57,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:56:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:56:57,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1290581143, now seen corresponding path program 1 times [2024-10-14 11:56:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:56:57,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728492245] [2024-10-14 11:56:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:56:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:56:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:56:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:56:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:56:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:56:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:56:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:56:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 11:56:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:56:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 11:56:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:56:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 11:56:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:56:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 11:56:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:56:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 11:56:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:56:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:56:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:56:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:56:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:56:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:56:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:56:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:56:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:56:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:56:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:56:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:56:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:56:57,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728492245] [2024-10-14 11:56:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728492245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:56:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:56:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:56:57,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738176400] [2024-10-14 11:56:57,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:56:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:56:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:56:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:56:58,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:56:58,003 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:56:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:56:58,064 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-14 11:56:58,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:56:58,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2024-10-14 11:56:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:56:58,076 INFO L225 Difference]: With dead ends: 145 [2024-10-14 11:56:58,077 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 11:56:58,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:56:58,090 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:56:58,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:56:58,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 11:56:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-14 11:56:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:56:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-14 11:56:58,153 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 161 [2024-10-14 11:56:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:56:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-14 11:56:58,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:56:58,154 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-14 11:56:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 11:56:58,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:56:58,159 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:56:58,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:56:58,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:56:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:56:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -685416791, now seen corresponding path program 1 times [2024-10-14 11:56:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:56:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403757272] [2024-10-14 11:56:58,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:56:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:56:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:56:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:56:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:56:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 11:56:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 11:56:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 11:56:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 11:56:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 11:56:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 11:56:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 11:56:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 11:56:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 11:56:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 11:56:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 11:56:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 11:56:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 11:56:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 11:56:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 11:56:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 11:56:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:56:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:56:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 11:56:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:56:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 11:56:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:56:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 11:56:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:56:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 11:56:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:56:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403757272] [2024-10-14 11:56:58,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403757272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:56:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:56:58,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:56:58,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103373359] [2024-10-14 11:56:58,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:56:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:56:58,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:56:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:56:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:56:58,568 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:56:58,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:56:58,616 INFO L93 Difference]: Finished difference Result 142 states and 221 transitions. [2024-10-14 11:56:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:56:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-14 11:56:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:56:58,620 INFO L225 Difference]: With dead ends: 142 [2024-10-14 11:56:58,620 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 11:56:58,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:56:58,622 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:56:58,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:56:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 11:56:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 11:56:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:56:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-14 11:56:58,635 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 161 [2024-10-14 11:56:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:56:58,639 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-14 11:56:58,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 11:56:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-14 11:56:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 11:56:58,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:56:58,642 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:56:58,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:56:58,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:56:58,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:56:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -628158489, now seen corresponding path program 1 times [2024-10-14 11:56:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:56:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679891212] [2024-10-14 11:56:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:56:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:56:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:56:58,901 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:56:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:56:59,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:56:59,060 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:56:59,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:56:59,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:56:59,066 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-14 11:56:59,182 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:56:59,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:56:59 BoogieIcfgContainer [2024-10-14 11:56:59,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:56:59,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:56:59,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:56:59,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:56:59,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:56:57" (3/4) ... [2024-10-14 11:56:59,191 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:56:59,193 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:56:59,194 INFO L158 Benchmark]: Toolchain (without parser) took 3115.36ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 118.1MB in the beginning and 173.9MB in the end (delta: -55.8MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,194 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:56:59,194 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.86ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 101.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.63ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 98.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,195 INFO L158 Benchmark]: Boogie Preprocessor took 66.03ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 95.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,196 INFO L158 Benchmark]: RCFGBuilder took 664.31ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 143.5MB in the end (delta: -48.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,196 INFO L158 Benchmark]: TraceAbstraction took 1899.47ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 142.8MB in the beginning and 173.9MB in the end (delta: -31.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-10-14 11:56:59,197 INFO L158 Benchmark]: Witness Printer took 5.16ms. Allocated memory is still 247.5MB. Free memory is still 173.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:56:59,199 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.10ms. Allocated memory is still 176.2MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.86ms. Allocated memory is still 176.2MB. Free memory was 118.1MB in the beginning and 101.8MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.63ms. Allocated memory is still 176.2MB. Free memory was 101.8MB in the beginning and 98.7MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.03ms. Allocated memory is still 176.2MB. Free memory was 98.7MB in the beginning and 95.0MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 664.31ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 143.5MB in the end (delta: -48.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1899.47ms. Allocated memory was 176.2MB in the beginning and 247.5MB in the end (delta: 71.3MB). Free memory was 142.8MB in the beginning and 173.9MB in the end (delta: -31.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Witness Printer took 5.16ms. Allocated memory is still 247.5MB. Free memory is still 173.9MB. 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 someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] signed char last_1_var_1_7 = 32; [L45] signed short int last_1_var_1_11 = 5; [L46] signed long int last_1_var_1_26 = 50; [L140] isInitial = 1 [L141] FCALL initially() [L142] int k_loop; [L143] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L143] COND TRUE k_loop < 1 [L144] CALL updateLastVariables() [L131] last_1_var_1_7 = var_1_7 [L132] last_1_var_1_11 = var_1_11 [L133] last_1_var_1_26 = var_1_26 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L89] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L90] var_1_3 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L91] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L92] var_1_4 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L95] var_1_5 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L96] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L99] var_1_10 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L105] var_1_14 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L108] var_1_15 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L111] var_1_18 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L117] var_1_20 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L123] var_1_22 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L126] var_1_24 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L127] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L128] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L128] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L145] RET updateVariables() [L146] CALL step() [L50] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L51] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L55] COND TRUE var_1_1 > var_1_4 [L56] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L60] COND TRUE \read(var_1_13) [L61] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L63] signed char stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L64] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L65] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L73] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L74] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L78] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L83] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L83] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L146] RET step() [L147] CALL, EXPR property() [L136] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L136-L137] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 212 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:56:59,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.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 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:57:01,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:57:01,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:57:01,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:57:01,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:57:01,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:57:01,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:57:01,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:57:01,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:57:01,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:57:01,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:57:01,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:57:01,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:57:01,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:57:01,703 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:57:01,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:57:01,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:57:01,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:57:01,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:57:01,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:57:01,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:57:01,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:57:01,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:57:01,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:57:01,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:57:01,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:57:01,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:57:01,714 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:57:01,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:57:01,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:57:01,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:57:01,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:57:01,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:57:01,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:57:01,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:57:01,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:57:01,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:57:01,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:57:01,717 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:57:01,717 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:57:01,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:57:01,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:57:01,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:57:01,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:57:01,720 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:57:01,720 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 -> 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 [2024-10-14 11:57:02,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:57:02,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:57:02,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:57:02,079 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:57:02,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:57:02,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:57:03,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:57:03,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:57:03,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:57:03,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848d10995/cd05a62959d44e319432b051e3288399/FLAG0fd5474b0 [2024-10-14 11:57:04,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/848d10995/cd05a62959d44e319432b051e3288399 [2024-10-14 11:57:04,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:57:04,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:57:04,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:57:04,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:57:04,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:57:04,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af273cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04, skipping insertion in model container [2024-10-14 11:57:04,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:57:04,502 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-14 11:57:04,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:57:04,603 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:57:04,617 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-14 11:57:04,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:57:04,685 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:57:04,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04 WrapperNode [2024-10-14 11:57:04,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:57:04,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:57:04,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:57:04,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:57:04,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,741 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-14 11:57:04,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:57:04,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:57:04,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:57:04,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:57:04,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,784 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:57:04,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:57:04,830 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:57:04,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:57:04,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:57:04,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (1/1) ... [2024-10-14 11:57:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:57:04,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:57:04,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:57:04,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:57:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:57:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:57:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:57:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:57:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:57:04,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:57:05,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:57:05,012 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:57:16,646 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 11:57:16,647 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:57:16,714 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:57:16,714 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:57:16,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:16 BoogieIcfgContainer [2024-10-14 11:57:16,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:57:16,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:57:16,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:57:16,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:57:16,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:57:04" (1/3) ... [2024-10-14 11:57:16,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6f8e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:16, skipping insertion in model container [2024-10-14 11:57:16,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:57:04" (2/3) ... [2024-10-14 11:57:16,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6f8e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:57:16, skipping insertion in model container [2024-10-14 11:57:16,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:57:16" (3/3) ... [2024-10-14 11:57:16,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-14 11:57:16,744 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:57:16,745 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:57:16,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:57:16,835 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;@11e7caba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:57:16,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:57:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:57:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 11:57:16,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:16,858 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:57:16,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:16,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:16,866 INFO L85 PathProgramCache]: Analyzing trace with hash -707107454, now seen corresponding path program 1 times [2024-10-14 11:57:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:57:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221300565] [2024-10-14 11:57:16,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:16,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:57:16,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:57:16,888 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:57:16,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:57:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:17,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:57:17,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:57:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-14 11:57:17,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:57:17,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:57:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221300565] [2024-10-14 11:57:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221300565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:57:17,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:57:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:57:17,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452531432] [2024-10-14 11:57:17,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:57:17,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:57:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:57:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:57:17,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:57:17,507 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:57:21,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:57:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:57:21,734 INFO L93 Difference]: Finished difference Result 127 states and 227 transitions. [2024-10-14 11:57:21,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:57:21,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 158 [2024-10-14 11:57:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:57:21,744 INFO L225 Difference]: With dead ends: 127 [2024-10-14 11:57:21,744 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 11:57:21,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:57:21,750 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:57:21,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:57:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 11:57:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 11:57:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 11:57:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-10-14 11:57:21,792 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 158 [2024-10-14 11:57:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:57:21,793 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-10-14 11:57:21,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 11:57:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-10-14 11:57:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 11:57:21,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:57:21,797 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:57:21,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:57:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:57:21,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:57:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:57:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1930165504, now seen corresponding path program 1 times [2024-10-14 11:57:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:57:22,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246704352] [2024-10-14 11:57:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:57:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:57:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:57:22,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:57:22,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:57:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:57:22,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 11:57:22,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:57:43,146 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:57:52,456 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_26~0 (_ bv50 32)) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (= (_ bv50 32) c_~last_1_var_1_26~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0))))) is different from true [2024-10-14 11:58:14,619 WARN L286 SmtUtils]: Spent 7.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 11:58:22,693 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)