./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_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 b66093e40d303c15b54496da83f949e9ee5e78e75ad30c10688fada4d9644fe3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:13:52,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:13:52,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:13:52,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:13:52,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:13:52,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:13:52,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:13:52,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:13:52,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:13:52,659 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:13:52,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:13:52,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:13:52,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:13:52,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:13:52,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:13:52,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:13:52,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:13:52,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:13:52,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:13:52,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:13:52,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:13:52,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:13:52,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:13:52,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:13:52,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:13:52,666 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:13:52,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:13:52,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:13:52,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:13:52,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:13:52,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:13:52,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:13:52,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:13:52,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:13:52,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:13:52,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:13:52,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:13:52,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:13:52,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:13:52,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:13:52,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:13:52,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:13:52,672 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 -> b66093e40d303c15b54496da83f949e9ee5e78e75ad30c10688fada4d9644fe3 [2024-11-09 00:13:52,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:13:52,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:13:52,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:13:52,956 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:13:52,956 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:13:52,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:13:54,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:13:54,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:13:54,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:13:54,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3eb01d1e/45948d3816e940c486cbed5141c028bd/FLAG0edc73b80 [2024-11-09 00:13:54,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3eb01d1e/45948d3816e940c486cbed5141c028bd [2024-11-09 00:13:54,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:13:54,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:13:54,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:54,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:13:54,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:13:54,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2628c1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:54, skipping insertion in model container [2024-11-09 00:13:54,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:13:54" (1/1) ... [2024-11-09 00:13:54,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:13:54,964 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i[915,928] [2024-11-09 00:13:55,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:55,025 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:13:55,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i[915,928] [2024-11-09 00:13:55,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:13:55,090 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:13:55,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55 WrapperNode [2024-11-09 00:13:55,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:13:55,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:55,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:13:55,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:13:55,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,134 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,187 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-09 00:13:55,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:13:55,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:13:55,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:13:55,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:13:55,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,216 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:13:55,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:13:55,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:13:55,257 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:13:55,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:13:55,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (1/1) ... [2024-11-09 00:13:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:13:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:13:55,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:13:55,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:13:55,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:13:55,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:13:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:13:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:13:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:13:55,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:13:55,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:13:55,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:13:55,863 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 00:13:55,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:13:55,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:13:55,878 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:13:55,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55 BoogieIcfgContainer [2024-11-09 00:13:55,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:13:55,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:13:55,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:13:55,886 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:13:55,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:13:54" (1/3) ... [2024-11-09 00:13:55,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94cf7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:13:55, skipping insertion in model container [2024-11-09 00:13:55,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:13:55" (2/3) ... [2024-11-09 00:13:55,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94cf7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:13:55, skipping insertion in model container [2024-11-09 00:13:55,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55" (3/3) ... [2024-11-09 00:13:55,890 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:13:55,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:13:55,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:13:55,983 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:13:55,992 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;@6ea357c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:13:55,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:13:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 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-11-09 00:13:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:13:56,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:13:56,014 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, 1, 1, 1, 1] [2024-11-09 00:13:56,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:13:56,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:13:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1546898536, now seen corresponding path program 1 times [2024-11-09 00:13:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:13:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662417153] [2024-11-09 00:13:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:13:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:13:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:13:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:13:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:13:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:13:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:13:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 00:13:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:13:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:13:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:13:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:13:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:13:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:13:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:13:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:13:56,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:13:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:13:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:13:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:13:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:13:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:13:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:13:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:13:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:13:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:13:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:13:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-09 00:13:56,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:13:56,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662417153] [2024-11-09 00:13:56,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662417153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:13:56,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:13:56,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:13:56,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116553131] [2024-11-09 00:13:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:13:56,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:13:56,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:13:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:13:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:13:56,564 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 51 states have internal predecessors, (69), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-09 00:13:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:13:56,593 INFO L93 Difference]: Finished difference Result 151 states and 262 transitions. [2024-11-09 00:13:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:13:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 165 [2024-11-09 00:13:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:13:56,604 INFO L225 Difference]: With dead ends: 151 [2024-11-09 00:13:56,604 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 00:13:56,609 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-11-09 00:13:56,613 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:13:56,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:13:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 00:13:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 00:13:56,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 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-11-09 00:13:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 114 transitions. [2024-11-09 00:13:56,714 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 114 transitions. Word has length 165 [2024-11-09 00:13:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:13:56,715 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 114 transitions. [2024-11-09 00:13:56,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-11-09 00:13:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 114 transitions. [2024-11-09 00:13:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:13:56,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:13:56,726 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, 1, 1, 1, 1] [2024-11-09 00:13:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:13:56,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:13:56,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:13:56,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1167843032, now seen corresponding path program 1 times [2024-11-09 00:13:56,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:13:56,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841407052] [2024-11-09 00:13:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:13:56,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:13:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:13:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:13:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:13:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:13:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 00:13:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 00:13:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:13:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:13:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 00:13:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:13:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:13:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:13:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:13:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:13:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:13:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:13:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:13:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:13:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:13:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:13:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:13:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:13:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:13:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 00:13:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:13:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:13:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-09 00:13:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:13:57,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841407052] [2024-11-09 00:13:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841407052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:13:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:13:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:13:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546743965] [2024-11-09 00:13:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:13:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:13:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:13:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:13:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:13:57,168 INFO L87 Difference]: Start difference. First operand 75 states and 114 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-09 00:13:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:13:57,198 INFO L93 Difference]: Finished difference Result 148 states and 227 transitions. [2024-11-09 00:13:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:13:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 165 [2024-11-09 00:13:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:13:57,201 INFO L225 Difference]: With dead ends: 148 [2024-11-09 00:13:57,202 INFO L226 Difference]: Without dead ends: 76 [2024-11-09 00:13:57,202 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-11-09 00:13:57,204 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:13:57,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:13:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-09 00:13:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-09 00:13:57,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 48 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-11-09 00:13:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-09 00:13:57,217 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 165 [2024-11-09 00:13:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:13:57,219 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-09 00:13:57,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-11-09 00:13:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-09 00:13:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:13:57,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:13:57,222 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, 1, 1, 1, 1] [2024-11-09 00:13:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:13:57,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:13:57,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:13:57,224 INFO L85 PathProgramCache]: Analyzing trace with hash 607164330, now seen corresponding path program 1 times [2024-11-09 00:13:57,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:13:57,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175492017] [2024-11-09 00:13:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:13:57,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:13:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:57,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:13:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:13:57,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:13:57,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:13:57,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:13:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:13:57,567 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:13:57,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:13:57,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:13:57 BoogieIcfgContainer [2024-11-09 00:13:57,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:13:57,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:13:57,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:13:57,698 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:13:57,700 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:13:55" (3/4) ... [2024-11-09 00:13:57,702 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:13:57,703 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:13:57,705 INFO L158 Benchmark]: Toolchain (without parser) took 2939.88ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 76.0MB in the beginning and 135.0MB in the end (delta: -59.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:13:57,705 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:13:57,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 151.0MB. Free memory was 75.8MB in the beginning and 60.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:13:57,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.49ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 60.0MB in the beginning and 157.3MB in the end (delta: -97.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-09 00:13:57,709 INFO L158 Benchmark]: Boogie Preprocessor took 68.66ms. Allocated memory is still 186.6MB. Free memory was 157.3MB in the beginning and 153.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:13:57,709 INFO L158 Benchmark]: RCFGBuilder took 621.64ms. Allocated memory is still 186.6MB. Free memory was 153.1MB in the beginning and 131.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:13:57,710 INFO L158 Benchmark]: TraceAbstraction took 1814.83ms. Allocated memory is still 186.6MB. Free memory was 130.0MB in the beginning and 135.0MB in the end (delta: -4.9MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2024-11-09 00:13:57,710 INFO L158 Benchmark]: Witness Printer took 6.61ms. Allocated memory is still 186.6MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:13:57,712 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.19ms. Allocated memory is still 151.0MB. Free memory is still 100.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.07ms. Allocated memory is still 151.0MB. Free memory was 75.8MB in the beginning and 60.0MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.49ms. Allocated memory was 151.0MB in the beginning and 186.6MB in the end (delta: 35.7MB). Free memory was 60.0MB in the beginning and 157.3MB in the end (delta: -97.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.66ms. Allocated memory is still 186.6MB. Free memory was 157.3MB in the beginning and 153.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 621.64ms. Allocated memory is still 186.6MB. Free memory was 153.1MB in the beginning and 131.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1814.83ms. Allocated memory is still 186.6MB. Free memory was 130.0MB in the beginning and 135.0MB in the end (delta: -4.9MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. * Witness Printer took 6.61ms. Allocated memory is still 186.6MB. Free memory is still 135.0MB. 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; VAL [isInitial=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] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] 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 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_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] RET updateLastVariables() [L144] 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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=-49, 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=63, 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] [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=-49, 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=63, 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] [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=-49, 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=63, 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=-49, 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=63, 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] [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=-49, 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=63, 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] [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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-49, 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=63, var_1_19=-25, var_1_1=5003/5, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, var_1_26=50, var_1_7=32] [L144] RET updateVariables() [L145] 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=-49, 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=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-49, var_1_11=-49, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-24, var_1_10=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-24, var_1_10=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=25, var_1_24=0, 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=-24, var_1_10=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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=-24, var_1_10=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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=-24, var_1_10=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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)) [L145] RET step() [L146] 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=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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) ; [L146] RET, EXPR property() [L146] 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=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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=-49, var_1_11=-49, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-49, var_1_18=63, var_1_19=-25, var_1_1=49637, var_1_20=-24, var_1_21=125, var_1_22=126, var_1_23=130, var_1_24=0, 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, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 227 mSDtfsCounter, 7 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=79occurred 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, 495 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 328 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 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-11-09 00:13:57,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_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 b66093e40d303c15b54496da83f949e9ee5e78e75ad30c10688fada4d9644fe3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:14:00,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:14:00,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:14:00,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:14:00,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:14:00,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:14:00,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:14:00,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:14:00,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:14:00,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:14:00,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:14:00,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:14:00,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:14:00,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:14:00,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:14:00,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:14:00,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:14:00,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:14:00,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:14:00,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:14:00,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:14:00,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:14:00,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:14:00,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:14:00,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:14:00,150 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:14:00,150 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:14:00,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:14:00,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:14:00,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:14:00,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:14:00,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:14:00,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:14:00,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:14:00,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:00,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:14:00,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:14:00,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:14:00,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:14:00,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:14:00,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:14:00,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:14:00,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:14:00,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:14:00,155 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 -> b66093e40d303c15b54496da83f949e9ee5e78e75ad30c10688fada4d9644fe3 [2024-11-09 00:14:00,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:14:00,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:14:00,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:14:00,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:14:00,510 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:14:00,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:14:02,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:14:02,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:14:02,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:14:02,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb096776/62aa6dd7ad3145d1b374c79908130008/FLAG3ed81933a [2024-11-09 00:14:02,377 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eb096776/62aa6dd7ad3145d1b374c79908130008 [2024-11-09 00:14:02,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:14:02,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:14:02,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:02,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:14:02,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:14:02,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702dbf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02, skipping insertion in model container [2024-11-09 00:14:02,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:14:02,615 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i[915,928] [2024-11-09 00:14:02,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:02,720 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:14:02,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-43.i[915,928] [2024-11-09 00:14:02,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:14:02,793 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:14:02,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02 WrapperNode [2024-11-09 00:14:02,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:14:02,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:02,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:14:02,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:14:02,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,849 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-09 00:14:02,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:14:02,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:14:02,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:14:02,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:14:02,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,888 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:14:02,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:14:02,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:14:02,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:14:02,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:14:02,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (1/1) ... [2024-11-09 00:14:02,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:14:02,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:14:02,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:14:02,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:14:03,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:14:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:14:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:14:03,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:14:03,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:14:03,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:14:03,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:14:03,108 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:14:14,265 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:14:14,265 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:14:14,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:14:14,282 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:14:14,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:14 BoogieIcfgContainer [2024-11-09 00:14:14,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:14:14,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:14:14,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:14:14,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:14:14,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:14:02" (1/3) ... [2024-11-09 00:14:14,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f18964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:14, skipping insertion in model container [2024-11-09 00:14:14,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:14:02" (2/3) ... [2024-11-09 00:14:14,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f18964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:14:14, skipping insertion in model container [2024-11-09 00:14:14,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:14:14" (3/3) ... [2024-11-09 00:14:14,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-43.i [2024-11-09 00:14:14,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:14:14,305 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:14:14,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:14:14,389 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;@353421b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:14:14,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:14:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-11-09 00:14:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:14:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:14,415 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, 1] [2024-11-09 00:14:14,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 630679338, now seen corresponding path program 1 times [2024-11-09 00:14:14,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:14:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260886663] [2024-11-09 00:14:14,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:14,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:14:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:14:14,446 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:14:14,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:14:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:14,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:14:14,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:14:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 914 trivial. 0 not checked. [2024-11-09 00:14:15,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:14:15,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:14:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260886663] [2024-11-09 00:14:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260886663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:14:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:14:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:14:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495369120] [2024-11-09 00:14:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:14:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:14:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:14:15,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:14:15,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:14:15,053 INFO L87 Difference]: Start difference. First operand has 70 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-11-09 00:14:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:14:15,086 INFO L93 Difference]: Finished difference Result 133 states and 234 transitions. [2024-11-09 00:14:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:14:15,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 162 [2024-11-09 00:14:15,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:14:15,098 INFO L225 Difference]: With dead ends: 133 [2024-11-09 00:14:15,099 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 00:14:15,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:14:15,106 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:14:15,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:14:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 00:14:15,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 00:14:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 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-11-09 00:14:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 99 transitions. [2024-11-09 00:14:15,157 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 99 transitions. Word has length 162 [2024-11-09 00:14:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:14:15,157 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 99 transitions. [2024-11-09 00:14:15,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-11-09 00:14:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 99 transitions. [2024-11-09 00:14:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:14:15,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:14:15,162 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, 1] [2024-11-09 00:14:15,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:14:15,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:14:15,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:14:15,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:14:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1370585452, now seen corresponding path program 1 times [2024-11-09 00:14:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:14:15,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616082923] [2024-11-09 00:14:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:14:15,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:14:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:14:15,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:14:15,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:14:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:14:15,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 00:14:15,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:14:41,423 WARN L286 SmtUtils]: Spent 6.34s 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-11-09 00:14:48,496 WARN L851 $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 false [2024-11-09 00:14:58,510 WARN L286 SmtUtils]: Spent 8.12s 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-11-09 00:15:27,512 WARN L851 $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)))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~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)))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0)) is different from false [2024-11-09 00:15:31,547 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)))) (fp.gt c_~var_1_1~0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~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)))) (= ((_ sign_extend 8) c_~var_1_10~0) c_~var_1_11~0)) is different from true