./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.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 eac3201ea586fadc4987068e5a4039e19e955780b16bce26dea5895ff77c2a90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:00:33,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:00:33,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:00:33,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:00:33,631 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:00:33,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:00:33,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:00:33,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:00:33,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:00:33,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:00:33,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:00:33,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:00:33,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:00:33,654 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:00:33,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:33,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:00:33,655 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> eac3201ea586fadc4987068e5a4039e19e955780b16bce26dea5895ff77c2a90 [2025-03-08 14:00:33,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:00:33,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:00:33,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:00:33,895 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:00:33,895 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:00:33,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:00:35,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1177d6ef/630c2dbd220f473eb8612a9cd188a2c7/FLAG96d9a7751 [2025-03-08 14:00:35,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:00:35,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:00:35,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1177d6ef/630c2dbd220f473eb8612a9cd188a2c7/FLAG96d9a7751 [2025-03-08 14:00:35,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1177d6ef/630c2dbd220f473eb8612a9cd188a2c7 [2025-03-08 14:00:35,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:00:35,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:00:35,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:35,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:00:35,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:00:35,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425a0e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35, skipping insertion in model container [2025-03-08 14:00:35,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:00:35,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i[916,929] [2025-03-08 14:00:35,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:35,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:00:35,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i[916,929] [2025-03-08 14:00:35,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:35,855 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:00:35,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35 WrapperNode [2025-03-08 14:00:35,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:35,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:35,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:00:35,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:00:35,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,897 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-08 14:00:35,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:35,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:00:35,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:00:35,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:00:35,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,921 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]. [2025-03-08 14:00:35,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,947 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:00:35,948 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:00:35,948 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:00:35,948 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:00:35,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (1/1) ... [2025-03-08 14:00:35,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:35,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:35,977 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) [2025-03-08 14:00:35,982 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 [2025-03-08 14:00:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:00:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:00:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:00:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:00:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:00:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:00:36,064 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:00:36,065 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:00:36,374 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 14:00:36,374 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:00:36,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:00:36,387 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:00:36,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:00:36 BoogieIcfgContainer [2025-03-08 14:00:36,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:00:36,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:00:36,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:00:36,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:00:36,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:00:35" (1/3) ... [2025-03-08 14:00:36,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5852c7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:00:36, skipping insertion in model container [2025-03-08 14:00:36,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:35" (2/3) ... [2025-03-08 14:00:36,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5852c7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:00:36, skipping insertion in model container [2025-03-08 14:00:36,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:00:36" (3/3) ... [2025-03-08 14:00:36,397 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:00:36,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:00:36,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:00:36,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:00:36,460 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;@106ae985, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:00:36,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:00:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:00:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:00:36,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:36,472 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:36,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:36,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1401716029, now seen corresponding path program 1 times [2025-03-08 14:00:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:36,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449956032] [2025-03-08 14:00:36,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:36,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:00:36,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:00:36,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-08 14:00:36,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449956032] [2025-03-08 14:00:36,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449956032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:00:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855196856] [2025-03-08 14:00:36,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:36,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:36,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:36,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:00:36,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:00:36,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:00:36,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:00:36,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:36,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:36,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:00:36,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:00:36,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-08 14:00:36,987 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:00:36,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855196856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:36,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:00:36,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:00:36,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169960569] [2025-03-08 14:00:36,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:36,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:00:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:37,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:00:37,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:00:37,014 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 14:00:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:37,036 INFO L93 Difference]: Finished difference Result 177 states and 309 transitions. [2025-03-08 14:00:37,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:00:37,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-03-08 14:00:37,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:37,042 INFO L225 Difference]: With dead ends: 177 [2025-03-08 14:00:37,042 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 14:00:37,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:00:37,046 INFO L435 NwaCegarLoop]: 138 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, 138 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 [2025-03-08 14:00:37,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:00:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 14:00:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 14:00:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:00:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-03-08 14:00:37,080 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-03-08 14:00:37,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:37,080 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-03-08 14:00:37,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 14:00:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-03-08 14:00:37,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:00:37,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:37,083 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:37,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:00:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:00:37,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1835758341, now seen corresponding path program 1 times [2025-03-08 14:00:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988808345] [2025-03-08 14:00:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:37,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:00:37,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:00:37,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:37,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 14:00:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988808345] [2025-03-08 14:00:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988808345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:37,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 14:00:37,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582349025] [2025-03-08 14:00:37,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:37,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 14:00:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:37,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 14:00:37,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:00:37,562 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 14:00:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:37,618 INFO L93 Difference]: Finished difference Result 207 states and 318 transitions. [2025-03-08 14:00:37,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 14:00:37,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-08 14:00:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:37,624 INFO L225 Difference]: With dead ends: 207 [2025-03-08 14:00:37,624 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 14:00:37,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 14:00:37,625 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:37,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 298 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:00:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 14:00:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-03-08 14:00:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 83 states have internal predecessors, (112), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-08 14:00:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 182 transitions. [2025-03-08 14:00:37,650 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 182 transitions. Word has length 191 [2025-03-08 14:00:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:37,652 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 182 transitions. [2025-03-08 14:00:37,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 14:00:37,652 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 182 transitions. [2025-03-08 14:00:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:00:37,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:37,656 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:37,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:00:37,656 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:37,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash -951657146, now seen corresponding path program 1 times [2025-03-08 14:00:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:37,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793306686] [2025-03-08 14:00:37,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:37,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:00:37,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:00:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:37,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-08 14:00:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793306686] [2025-03-08 14:00:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793306686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:00:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:00:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 14:00:39,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634187845] [2025-03-08 14:00:39,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:00:39,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 14:00:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 14:00:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 14:00:39,276 INFO L87 Difference]: Start difference. First operand 120 states and 182 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 14:00:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:39,686 INFO L93 Difference]: Finished difference Result 377 states and 583 transitions. [2025-03-08 14:00:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 14:00:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-03-08 14:00:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:39,691 INFO L225 Difference]: With dead ends: 377 [2025-03-08 14:00:39,692 INFO L226 Difference]: Without dead ends: 260 [2025-03-08 14:00:39,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:00:39,695 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 150 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:39,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 551 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 14:00:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-08 14:00:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2025-03-08 14:00:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 142 states have (on average 1.380281690140845) internal successors, (196), 143 states have internal predecessors, (196), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-08 14:00:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2025-03-08 14:00:39,730 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 191 [2025-03-08 14:00:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:39,731 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2025-03-08 14:00:39,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-08 14:00:39,732 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2025-03-08 14:00:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:00:39,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:39,735 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:39,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:00:39,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:39,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:39,736 INFO L85 PathProgramCache]: Analyzing trace with hash 593013759, now seen corresponding path program 1 times [2025-03-08 14:00:39,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:39,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94863432] [2025-03-08 14:00:39,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:39,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:39,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:00:39,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:00:39,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:39,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 14:00:40,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:40,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94863432] [2025-03-08 14:00:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94863432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:00:40,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575408756] [2025-03-08 14:00:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:40,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:40,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:00:40,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:00:40,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:00:40,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:00:40,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:40,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:40,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 14:00:40,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:00:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 14:00:40,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:00:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 14:00:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575408756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:00:40,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:00:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 14:00:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577457835] [2025-03-08 14:00:40,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:00:40,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:00:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:40,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:00:40,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:00:40,599 INFO L87 Difference]: Start difference. First operand 211 states and 326 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-08 14:00:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:40,896 INFO L93 Difference]: Finished difference Result 344 states and 509 transitions. [2025-03-08 14:00:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 14:00:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 192 [2025-03-08 14:00:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:40,898 INFO L225 Difference]: With dead ends: 344 [2025-03-08 14:00:40,898 INFO L226 Difference]: Without dead ends: 194 [2025-03-08 14:00:40,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-03-08 14:00:40,899 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 171 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:40,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 245 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:00:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-08 14:00:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-03-08 14:00:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 114 states have (on average 1.236842105263158) internal successors, (141), 114 states have internal predecessors, (141), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:00:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2025-03-08 14:00:40,930 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 192 [2025-03-08 14:00:40,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:40,930 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2025-03-08 14:00:40,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 3 states have call successors, (71), 2 states have call predecessors, (71), 4 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-03-08 14:00:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2025-03-08 14:00:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 14:00:40,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:40,932 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:40,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:00:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-08 14:00:41,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:41,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -350199105, now seen corresponding path program 1 times [2025-03-08 14:00:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:41,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112972939] [2025-03-08 14:00:41,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:41,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:00:41,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:00:41,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:41,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 14:00:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:00:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112972939] [2025-03-08 14:00:41,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112972939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:00:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613368176] [2025-03-08 14:00:41,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:41,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:41,479 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:00:41,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:00:41,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 14:00:41,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 14:00:41,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:41,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:00:41,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 14:00:41,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:00:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 659 proven. 66 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2025-03-08 14:00:41,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:00:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 14:00:41,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613368176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:00:41,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:00:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 14:00:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507763503] [2025-03-08 14:00:41,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:00:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:00:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:00:41,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:00:41,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 14:00:41,997 INFO L87 Difference]: Start difference. First operand 182 states and 261 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-08 14:00:42,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:00:42,195 INFO L93 Difference]: Finished difference Result 315 states and 441 transitions. [2025-03-08 14:00:42,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:00:42,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 194 [2025-03-08 14:00:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:00:42,199 INFO L225 Difference]: With dead ends: 315 [2025-03-08 14:00:42,200 INFO L226 Difference]: Without dead ends: 202 [2025-03-08 14:00:42,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 14:00:42,201 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 108 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:00:42,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 300 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:00:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-08 14:00:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 190. [2025-03-08 14:00:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 120 states have internal predecessors, (143), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 14:00:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2025-03-08 14:00:42,227 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 194 [2025-03-08 14:00:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:00:42,228 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2025-03-08 14:00:42,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2025-03-08 14:00:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2025-03-08 14:00:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 14:00:42,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:00:42,230 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:00:42,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 14:00:42,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:42,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:00:42,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:00:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 615277853, now seen corresponding path program 1 times [2025-03-08 14:00:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:00:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283518193] [2025-03-08 14:00:42,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:00:42,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:00:42,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:00:42,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:42,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:00:42,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619366660] [2025-03-08 14:00:42,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:00:42,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:42,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:42,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:00:42,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 14:00:42,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:00:42,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:00:42,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:42,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:00:42,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:00:42,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 14:00:42,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 14:00:42,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:00:42,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:00:43,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:00:43,025 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:00:43,026 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:00:43,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 14:00:43,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:00:43,230 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 14:00:43,328 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:00:43,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:00:43 BoogieIcfgContainer [2025-03-08 14:00:43,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:00:43,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:00:43,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:00:43,330 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:00:43,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:00:36" (3/4) ... [2025-03-08 14:00:43,332 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:00:43,336 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:00:43,336 INFO L158 Benchmark]: Toolchain (without parser) took 7732.30ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 103.9MB in the beginning and 205.1MB in the end (delta: -101.1MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2025-03-08 14:00:43,336 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:00:43,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.50ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:00:43,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.77ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 82.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:00:43,337 INFO L158 Benchmark]: Boogie Preprocessor took 48.20ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 75.9MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:00:43,337 INFO L158 Benchmark]: IcfgBuilder took 439.53ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 48.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 14:00:43,337 INFO L158 Benchmark]: TraceAbstraction took 6938.76ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 47.1MB in the beginning and 205.2MB in the end (delta: -158.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2025-03-08 14:00:43,337 INFO L158 Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 335.5MB. Free memory was 205.2MB in the beginning and 205.1MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:00:43,338 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.20ms. Allocated memory is still 201.3MB. Free memory was 125.4MB in the beginning and 125.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.50ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 86.9MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.77ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 82.8MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.20ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 75.9MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 439.53ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 48.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6938.76ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 47.1MB in the beginning and 205.2MB in the end (delta: -158.0MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 5.43ms. Allocated memory is still 335.5MB. Free memory was 205.2MB in the beginning and 205.1MB in the end (delta: 106.2kB). 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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someUnaryDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.2; [L23] double var_1_4 = 10000000.9; [L24] double var_1_5 = 32.46; [L25] double var_1_6 = 10000.6; [L26] unsigned long int var_1_7 = 128; [L27] unsigned long int var_1_9 = 1; [L28] unsigned long int var_1_10 = 10000; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 1; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 63.8; [L35] double var_1_18 = 64.125; [L36] double var_1_19 = 0.9; [L37] float var_1_20 = 8.8; [L38] float var_1_21 = 999999999999.75; [L39] float var_1_22 = 127.5; [L40] unsigned long int var_1_23 = 25; [L41] float var_1_24 = 127.75; [L42] float var_1_25 = 64.7; [L43] signed char var_1_26 = -128; [L44] signed char var_1_27 = 64; [L45] signed char var_1_28 = -16; [L46] signed char var_1_29 = -2; [L47] unsigned short int var_1_30 = 4; [L48] unsigned short int var_1_31 = 57679; [L49] unsigned short int var_1_32 = 23164; [L50] unsigned short int var_1_33 = 1; [L51] double last_1_var_1_1 = 32.2; [L52] unsigned long int last_1_var_1_7 = 128; [L53] unsigned long int last_1_var_1_9 = 1; [L54] unsigned short int last_1_var_1_30 = 4; VAL [isInitial=0, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] int k_loop; [L209] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L209] COND TRUE k_loop < 1 [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_7 = var_1_7 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L147] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L149] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L150] var_1_6 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L151] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L152] var_1_10 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L156] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L162] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L164] var_1_16 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L167] var_1_18 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L168] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L169] var_1_19 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L170] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L171] var_1_23 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L172] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L176] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L178] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L179] var_1_27 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L180] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L182] var_1_29 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L183] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L185] var_1_31 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_31 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L186] RET assume_abort_if_not(var_1_31 >= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L188] var_1_32 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_32 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L189] RET assume_abort_if_not(var_1_32 >= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L191] var_1_33 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_7=128, var_1_9=1] [L193] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=1] [L193] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=1] [L211] RET updateVariables() [L212] CALL step() [L58] var_1_9 = (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30))) [L59] unsigned char stepLocal_8 = var_1_14; [L60] unsigned char stepLocal_7 = var_1_14; [L61] unsigned short int stepLocal_6 = var_1_32; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_7=1, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L62] COND FALSE !(stepLocal_7 && var_1_16) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L65] COND TRUE (var_1_13 && (last_1_var_1_1 > 64.177)) || stepLocal_8 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L66] COND TRUE var_1_10 >= stepLocal_6 [L67] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L75] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_0=4, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L76] COND TRUE var_1_30 >= stepLocal_0 [L77] var_1_1 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L81] COND TRUE \read(var_1_13) [L82] var_1_17 = ((var_1_18 - var_1_19) + var_1_4) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L86] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_7=128, var_1_9=4] [L87] COND TRUE var_1_5 > var_1_18 [L88] var_1_21 = ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L93] signed long int stepLocal_4 = ~ var_1_30; [L94] unsigned short int stepLocal_3 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_4=-7, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L95] COND FALSE !((var_1_30 / var_1_23) == stepLocal_4) [L100] var_1_22 = 7.5f VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L102] unsigned short int stepLocal_5 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L103] COND FALSE !(var_1_18 > var_1_24) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L110] COND TRUE var_1_4 <= (var_1_21 + (var_1_5 * var_1_6)) [L111] var_1_12 = ((var_1_13 && var_1_14) && var_1_15) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_6=0, var_1_7=128, var_1_9=4] [L115] COND TRUE (var_1_30 == var_1_30) || var_1_12 [L116] var_1_20 = ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L118] COND FALSE !(var_1_1 > (var_1_20 * (var_1_24 / 2.8))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L133] unsigned long int stepLocal_2 = var_1_9 - var_1_30; [L134] unsigned long int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_1=4, stepLocal_2=-2, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L135] COND TRUE 32 > stepLocal_1 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_2=-2, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L136] COND TRUE (- var_1_30) != stepLocal_2 [L137] var_1_7 = ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=-131066, stepLocal_5=-131066, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L212] RET step() [L213] CALL, EXPR property() [L202-L203] return (((((((((((var_1_30 >= var_1_9) ? (var_1_1 == ((double) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))))) : (var_1_1 == ((double) (var_1_4 + var_1_5)))) && ((32 > var_1_9) ? (((- var_1_30) != (var_1_9 - var_1_30)) ? (var_1_7 == ((unsigned long int) ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))))) : (var_1_7 == ((unsigned long int) var_1_9))) : (var_1_7 == ((unsigned long int) var_1_9)))) && (var_1_9 == ((unsigned long int) (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30)))))) && ((var_1_4 <= (var_1_21 + (var_1_5 * var_1_6))) ? (var_1_12 == ((unsigned char) ((var_1_13 && var_1_14) && var_1_15))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_13 ? (var_1_17 == ((double) ((var_1_18 - var_1_19) + var_1_4))) : (var_1_17 == ((double) var_1_6)))) && (((var_1_30 == var_1_30) || var_1_12) ? (var_1_20 == ((float) ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))))) : 1)) && (var_1_13 ? ((var_1_5 > var_1_18) ? (var_1_21 == ((float) ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))))) : 1) : (var_1_21 == ((float) (var_1_5 + (1.55f + 5.7f)))))) && (((var_1_30 / var_1_23) == (~ var_1_30)) ? (((var_1_30 + (- var_1_30)) >= var_1_30) ? (var_1_22 == ((float) ((var_1_24 + var_1_25) + (var_1_18 - ((((31.85f) > (10.5f)) ? (31.85f) : (10.5f))))))) : 1) : (var_1_22 == ((float) 7.5f)))) && ((var_1_1 > (var_1_20 * (var_1_24 / 2.8))) ? (var_1_14 ? (var_1_13 ? (var_1_26 == ((signed char) ((((var_1_27) > (0)) ? (var_1_27) : (0))))) : (var_1_16 ? (var_1_26 == ((signed char) var_1_27)) : (var_1_26 == ((signed char) var_1_27)))) : (var_1_26 == ((signed char) var_1_27))) : 1)) && ((var_1_18 > var_1_24) ? ((var_1_23 <= var_1_30) ? (var_1_28 == ((signed char) ((((var_1_27) > (var_1_29)) ? (var_1_27) : (var_1_29))))) : (var_1_28 == ((signed char) var_1_29))) : 1)) && ((var_1_14 && var_1_16) ? (var_1_30 == ((unsigned short int) (var_1_31 - ((((var_1_32 - var_1_33) < 0 ) ? -(var_1_32 - var_1_33) : (var_1_32 - var_1_33)))))) : (((var_1_13 && (last_1_var_1_1 > 64.177)) || var_1_14) ? ((var_1_10 >= var_1_32) ? (var_1_30 == ((unsigned short int) var_1_33)) : ((! (last_1_var_1_9 >= var_1_27)) ? (var_1_30 == ((unsigned short int) var_1_33)) : 1)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=-131066, var_1_31=32767, var_1_32=16383, var_1_33=-131066, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 171 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 6, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 1532 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 871 mSDsCounter, 187 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 646 IncrementalHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 187 mSolverCounterUnsat, 661 mSDtfsCounter, 646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1002 GetRequests, 962 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, InterpolantAutomatonStates: 35, 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, 5 MinimizatonAttempts, 76 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1926 NumberOfCodeBlocks, 1926 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1912 ConstructedInterpolants, 0 QuantifiedInterpolants, 5293 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1351 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 16970/17400 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:00:43,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.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 eac3201ea586fadc4987068e5a4039e19e955780b16bce26dea5895ff77c2a90 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:00:45,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:00:45,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:00:45,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:00:45,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:00:45,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:00:45,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:00:45,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:00:45,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:00:45,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:00:45,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:00:45,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:00:45,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:00:45,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:00:45,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:00:45,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:00:45,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:00:45,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:00:45,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:00:45,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:45,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:00:45,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:00:45,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:00:45,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:00:45,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:00:45,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> eac3201ea586fadc4987068e5a4039e19e955780b16bce26dea5895ff77c2a90 [2025-03-08 14:00:45,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:00:45,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:00:45,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:00:45,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:00:45,457 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:00:45,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:00:46,609 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c79f63e8/9c27c27f7e804e2b942626493ebca16f/FLAGf18647ab3 [2025-03-08 14:00:46,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:00:46,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:00:46,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c79f63e8/9c27c27f7e804e2b942626493ebca16f/FLAGf18647ab3 [2025-03-08 14:00:47,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c79f63e8/9c27c27f7e804e2b942626493ebca16f [2025-03-08 14:00:47,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:00:47,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:00:47,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:47,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:00:47,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:00:47,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6da97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47, skipping insertion in model container [2025-03-08 14:00:47,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:00:47,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i[916,929] [2025-03-08 14:00:47,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:47,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:00:47,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-62.i[916,929] [2025-03-08 14:00:47,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:00:47,389 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:00:47,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47 WrapperNode [2025-03-08 14:00:47,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:00:47,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:47,391 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:00:47,391 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:00:47,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,425 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2025-03-08 14:00:47,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:00:47,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:00:47,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:00:47,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:00:47,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,444 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]. [2025-03-08 14:00:47,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,464 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:00:47,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:00:47,471 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:00:47,471 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:00:47,471 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (1/1) ... [2025-03-08 14:00:47,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:00:47,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:00:47,494 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) [2025-03-08 14:00:47,496 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 [2025-03-08 14:00:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:00:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:00:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:00:47,512 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:00:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:00:47,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:00:47,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:00:47,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:01:19,472 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-03-08 14:01:19,472 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:01:19,482 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:01:19,483 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:01:19,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:19 BoogieIcfgContainer [2025-03-08 14:01:19,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:01:19,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:01:19,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:01:19,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:01:19,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:00:47" (1/3) ... [2025-03-08 14:01:19,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cf449e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:19, skipping insertion in model container [2025-03-08 14:01:19,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:00:47" (2/3) ... [2025-03-08 14:01:19,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42cf449e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:01:19, skipping insertion in model container [2025-03-08 14:01:19,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:01:19" (3/3) ... [2025-03-08 14:01:19,490 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-62.i [2025-03-08 14:01:19,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:01:19,501 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:01:19,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:01:19,546 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;@3569865c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:01:19,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:01:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:01:19,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:01:19,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:19,561 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:01:19,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1401716029, now seen corresponding path program 1 times [2025-03-08 14:01:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:01:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328599356] [2025-03-08 14:01:19,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:19,576 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 [2025-03-08 14:01:19,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:01:19,578 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) [2025-03-08 14:01:19,579 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 [2025-03-08 14:01:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:01:21,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:01:21,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:21,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:21,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:01:21,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:01:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2025-03-08 14:01:21,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:01:21,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:01:21,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328599356] [2025-03-08 14:01:21,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328599356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:01:21,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:01:21,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:01:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589730596] [2025-03-08 14:01:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:01:21,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:01:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:01:21,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:01:21,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:01:21,533 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 14:01:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:01:21,553 INFO L93 Difference]: Finished difference Result 177 states and 309 transitions. [2025-03-08 14:01:21,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:01:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-03-08 14:01:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:01:21,560 INFO L225 Difference]: With dead ends: 177 [2025-03-08 14:01:21,560 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 14:01:21,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:01:21,564 INFO L435 NwaCegarLoop]: 138 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, 138 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 [2025-03-08 14:01:21,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:01:21,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 14:01:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-08 14:01:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:01:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-03-08 14:01:21,595 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-03-08 14:01:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:01:21,595 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-03-08 14:01:21,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 14:01:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-03-08 14:01:21,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 14:01:21,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:01:21,598 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:01:21,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:01:21,799 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 [2025-03-08 14:01:21,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:01:21,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:01:21,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1835758341, now seen corresponding path program 1 times [2025-03-08 14:01:21,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:01:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393265319] [2025-03-08 14:01:21,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:01:21,801 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 [2025-03-08 14:01:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:01:21,804 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) [2025-03-08 14:01:21,805 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 [2025-03-08 14:01:21,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 14:01:23,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 14:01:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:01:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:01:23,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 14:01:23,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:01:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-08 14:01:28,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:01:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-08 14:01:34,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:01:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393265319] [2025-03-08 14:01:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393265319] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:01:34,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:01:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 14:01:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215476644] [2025-03-08 14:01:34,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:01:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 14:01:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:01:34,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 14:01:34,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:01:34,525 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 14:01:43,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:01:47,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:01:52,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:01:56,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:02:00,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:02:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:02:00,492 INFO L93 Difference]: Finished difference Result 179 states and 274 transitions. [2025-03-08 14:02:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 14:02:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 191 [2025-03-08 14:02:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:02:00,729 INFO L225 Difference]: With dead ends: 179 [2025-03-08 14:02:00,729 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 14:02:00,730 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:02:00,734 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 31 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:02:00,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 231 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 25.2s Time] [2025-03-08 14:02:00,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 14:02:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-03-08 14:02:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 14:02:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2025-03-08 14:02:00,753 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 191 [2025-03-08 14:02:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:02:00,753 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2025-03-08 14:02:00,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 14:02:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2025-03-08 14:02:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 14:02:00,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:02:00,759 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:02:00,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 14:02:00,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:02:00,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:02:00,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:02:00,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2028985244, now seen corresponding path program 1 times [2025-03-08 14:02:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:02:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380810670] [2025-03-08 14:02:00,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:02:00,961 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 [2025-03-08 14:02:00,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:02:00,963 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:02:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 14:02:01,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 14:02:02,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 14:02:02,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:02:02,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:02:02,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:02:02,677 INFO L279 TraceCheckSpWp]: Computing forward predicates...