./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-while_file-42.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 56ea9eca1a4d54f040375ecddb79be030f7a108b14f59fe60ae81accfdd79295 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:58:06,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:58:06,566 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:58:06,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:58:06,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:58:06,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:58:06,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:58:06,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:58:06,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:58:06,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:58:06,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:58:06,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:58:06,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:58:06,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:58:06,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:58:06,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:58:06,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:58:06,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:06,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:58:06,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:58:06,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:58:06,598 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 -> 56ea9eca1a4d54f040375ecddb79be030f7a108b14f59fe60ae81accfdd79295 [2025-03-03 22:58:06,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:58:06,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:58:06,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:58:06,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:58:06,851 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:58:06,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:08,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe42c6ba/fd54da50b8e14e158a6e4d03e3fbd5bc/FLAG3ac833360 [2025-03-03 22:58:08,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:58:08,320 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:08,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe42c6ba/fd54da50b8e14e158a6e4d03e3fbd5bc/FLAG3ac833360 [2025-03-03 22:58:08,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbe42c6ba/fd54da50b8e14e158a6e4d03e3fbd5bc [2025-03-03 22:58:08,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:58:08,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:58:08,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:08,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:58:08,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:58:08,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed30001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08, skipping insertion in model container [2025-03-03 22:58:08,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:58:08,741 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i[916,929] [2025-03-03 22:58:08,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:08,800 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:58:08,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i[916,929] [2025-03-03 22:58:08,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:08,857 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:58:08,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08 WrapperNode [2025-03-03 22:58:08,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:08,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:08,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:58:08,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:58:08,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,900 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-03-03 22:58:08,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:08,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:58:08,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:58:08,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:58:08,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,929 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-03 22:58:08,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,942 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:58:08,946 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:58:08,946 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:58:08,946 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:58:08,947 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (1/1) ... [2025-03-03 22:58:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:08,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:08,976 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-03 22:58:08,984 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-03 22:58:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:58:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:58:08,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:58:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:58:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:58:08,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:58:09,056 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:58:09,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:58:09,359 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 22:58:09,386 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 22:58:09,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:58:09,401 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:58:09,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:58:09,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:09 BoogieIcfgContainer [2025-03-03 22:58:09,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:58:09,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:58:09,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:58:09,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:58:09,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:58:08" (1/3) ... [2025-03-03 22:58:09,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124b454b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:09, skipping insertion in model container [2025-03-03 22:58:09,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:08" (2/3) ... [2025-03-03 22:58:09,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124b454b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:09, skipping insertion in model container [2025-03-03 22:58:09,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:09" (3/3) ... [2025-03-03 22:58:09,412 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:09,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:58:09,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-42.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:58:09,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:58:09,478 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;@94df0c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:58:09,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:58:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:58:09,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:09,492 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:09,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:09,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1684401144, now seen corresponding path program 1 times [2025-03-03 22:58:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78433032] [2025-03-03 22:58:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:09,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:09,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:58:09,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:58:09,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:09,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:58:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78433032] [2025-03-03 22:58:09,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78433032] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:58:09,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629340854] [2025-03-03 22:58:09,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:09,755 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-03 22:58:09,758 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-03 22:58:09,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:58:09,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:58:09,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:09,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:09,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:58:09,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:09,937 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 22:58:09,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:58:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629340854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:58:09,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:58:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:58:09,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594687871] [2025-03-03 22:58:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:58:09,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:58:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:09,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:58:09,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:58:09,960 INFO L87 Difference]: Start difference. First operand has 80 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:09,978 INFO L93 Difference]: Finished difference Result 154 states and 257 transitions. [2025-03-03 22:58:09,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:58:09,980 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-03-03 22:58:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:09,984 INFO L225 Difference]: With dead ends: 154 [2025-03-03 22:58:09,984 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 22:58:09,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-03 22:58:09,988 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:09,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:58:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 22:58:10,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 22:58:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:10,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2025-03-03 22:58:10,018 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 141 [2025-03-03 22:58:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:10,019 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2025-03-03 22:58:10,019 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, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2025-03-03 22:58:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:58:10,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:10,022 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:10,028 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-03 22:58:10,222 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-03 22:58:10,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:10,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:10,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2043897800, now seen corresponding path program 1 times [2025-03-03 22:58:10,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:10,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880928688] [2025-03-03 22:58:10,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:10,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:58:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:58:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:58:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880928688] [2025-03-03 22:58:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880928688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:58:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:58:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:58:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659570515] [2025-03-03 22:58:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:58:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:58:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:10,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:58:10,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:58:10,912 INFO L87 Difference]: Start difference. First operand 77 states and 116 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:58:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:11,164 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2025-03-03 22:58:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:58:11,165 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2025-03-03 22:58:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:11,167 INFO L225 Difference]: With dead ends: 226 [2025-03-03 22:58:11,167 INFO L226 Difference]: Without dead ends: 152 [2025-03-03 22:58:11,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:58:11,168 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 93 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:11,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 414 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:58:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-03 22:58:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2025-03-03 22:58:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:58:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 181 transitions. [2025-03-03 22:58:11,198 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 181 transitions. Word has length 141 [2025-03-03 22:58:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 181 transitions. [2025-03-03 22:58:11,198 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:58:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 181 transitions. [2025-03-03 22:58:11,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:58:11,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:11,201 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:58:11,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1685142391, now seen corresponding path program 1 times [2025-03-03 22:58:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369827824] [2025-03-03 22:58:11,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:11,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:11,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:11,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 81 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2025-03-03 22:58:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369827824] [2025-03-03 22:58:11,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369827824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:58:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108609807] [2025-03-03 22:58:11,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:11,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:11,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:11,883 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-03 22:58:11,885 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-03 22:58:11,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:12,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:12,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 22:58:12,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 338 proven. 81 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-03-03 22:58:12,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:58:13,225 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-03 22:58:13,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108609807] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:58:13,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:58:13,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 17 [2025-03-03 22:58:13,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413620679] [2025-03-03 22:58:13,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:58:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 22:58:13,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:13,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 22:58:13,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 22:58:13,229 INFO L87 Difference]: Start difference. First operand 121 states and 181 transitions. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 22:58:13,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:13,574 INFO L93 Difference]: Finished difference Result 230 states and 322 transitions. [2025-03-03 22:58:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 22:58:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 142 [2025-03-03 22:58:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:13,577 INFO L225 Difference]: With dead ends: 230 [2025-03-03 22:58:13,577 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 22:58:13,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2025-03-03 22:58:13,578 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 232 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:13,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 287 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:58:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 22:58:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2025-03-03 22:58:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2105263157894737) internal successors, (115), 95 states have internal predecessors, (115), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:58:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2025-03-03 22:58:13,612 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 142 [2025-03-03 22:58:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:13,612 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2025-03-03 22:58:13,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 3 states have call successors, (35), 3 states have call predecessors, (35), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2025-03-03 22:58:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2025-03-03 22:58:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:58:13,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:13,616 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:13,623 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-03 22:58:13,817 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,SelfDestructingSolverStorable2 [2025-03-03 22:58:13,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:13,818 INFO L85 PathProgramCache]: Analyzing trace with hash -111808968, now seen corresponding path program 1 times [2025-03-03 22:58:13,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:13,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681186268] [2025-03-03 22:58:13,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:13,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:13,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:13,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:13,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:13,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:58:13,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1841531872] [2025-03-03 22:58:13,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:13,947 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-03 22:58:13,949 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-03 22:58:14,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:14,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:14,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:14,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:14,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 22:58:14,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 475 proven. 75 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-03 22:58:15,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:58:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:58:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681186268] [2025-03-03 22:58:16,081 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:58:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841531872] [2025-03-03 22:58:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841531872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:58:16,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:58:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-03 22:58:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585042647] [2025-03-03 22:58:16,082 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:58:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 22:58:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:58:16,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 22:58:16,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:58:16,083 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 22:58:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:16,680 INFO L93 Difference]: Finished difference Result 311 states and 419 transitions. [2025-03-03 22:58:16,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 22:58:16,680 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) Word has length 142 [2025-03-03 22:58:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:16,683 INFO L225 Difference]: With dead ends: 311 [2025-03-03 22:58:16,683 INFO L226 Difference]: Without dead ends: 226 [2025-03-03 22:58:16,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 22:58:16,684 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 263 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:58:16,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 561 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 22:58:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-03 22:58:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 186. [2025-03-03 22:58:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 134 states have internal predecessors, (170), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:58:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 250 transitions. [2025-03-03 22:58:16,714 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 250 transitions. Word has length 142 [2025-03-03 22:58:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:16,715 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 250 transitions. [2025-03-03 22:58:16,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 4 states have call predecessors, (20), 6 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20) [2025-03-03 22:58:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 250 transitions. [2025-03-03 22:58:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:58:16,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:16,717 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:16,725 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-03 22:58:16,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:16,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:16,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:16,924 INFO L85 PathProgramCache]: Analyzing trace with hash -617367593, now seen corresponding path program 1 times [2025-03-03 22:58:16,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:58:16,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340689079] [2025-03-03 22:58:16,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:16,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:58:16,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:16,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:16,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:58:16,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [937019518] [2025-03-03 22:58:16,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:16,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:16,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:16,985 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-03 22:58:16,987 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-03 22:58:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:58:17,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 22:58:17,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:58:17,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:58:17,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:17,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 22:58:17,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 22:58:17,199 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 22:58:17,200 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 22:58:17,207 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-03 22:58:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:58:17,404 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 22:58:17,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 22:58:17,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:58:17 BoogieIcfgContainer [2025-03-03 22:58:17,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 22:58:17,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 22:58:17,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 22:58:17,477 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 22:58:17,479 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:09" (3/4) ... [2025-03-03 22:58:17,480 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 22:58:17,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 22:58:17,482 INFO L158 Benchmark]: Toolchain (without parser) took 8857.05ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 121.4MB in the beginning and 143.6MB in the end (delta: -22.2MB). Peak memory consumption was 196.9MB. Max. memory is 16.1GB. [2025-03-03 22:58:17,482 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:17,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.83ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 105.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 22:58:17,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.95ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 100.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 22:58:17,483 INFO L158 Benchmark]: Boogie Preprocessor took 44.64ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 93.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:17,483 INFO L158 Benchmark]: IcfgBuilder took 456.15ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 63.1MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 22:58:17,484 INFO L158 Benchmark]: TraceAbstraction took 8070.84ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 62.2MB in the beginning and 143.7MB in the end (delta: -81.4MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. [2025-03-03 22:58:17,484 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 385.9MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 22:58:17,484 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 is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.83ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 105.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.95ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 100.5MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.64ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 93.6MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 456.15ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 63.1MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8070.84ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 62.2MB in the beginning and 143.7MB in the end (delta: -81.4MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 385.9MB. Free memory was 143.7MB in the beginning and 143.6MB in the end (delta: 78.1kB). 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 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63, overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 140, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 163. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 50.75; [L23] double var_1_3 = 8.5; [L24] double var_1_4 = 64.5; [L25] double var_1_5 = 9.3; [L26] unsigned char var_1_6 = 1; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 2; [L31] double var_1_12 = 127.6; [L32] unsigned char var_1_13 = 0; [L33] signed long int var_1_14 = 1; [L34] unsigned char var_1_15 = 128; [L35] unsigned char var_1_16 = 128; [L36] unsigned char var_1_17 = 1; [L37] unsigned char var_1_18 = 16; [L38] unsigned char var_1_19 = 0; [L39] signed char var_1_21 = -32; [L40] signed char var_1_22 = 2; [L41] double var_1_23 = 15.5; [L42] float var_1_24 = 2.625; [L43] double var_1_25 = 4.375; [L44] double var_1_26 = 2.35; [L45] double var_1_27 = 64.25; [L46] signed short int var_1_28 = -5; [L47] float var_1_29 = 0.0; [L48] unsigned char var_1_30 = 2; [L49] unsigned long int var_1_31 = 2; [L50] double last_1_var_1_1 = 50.75; [L51] unsigned char last_1_var_1_13 = 0; [L52] signed long int last_1_var_1_14 = 1; [L53] unsigned char last_1_var_1_15 = 128; [L54] unsigned char last_1_var_1_30 = 2; VAL [isInitial=0, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L170] last_1_var_1_1 = var_1_1 [L171] last_1_var_1_13 = var_1_13 [L172] last_1_var_1_14 = var_1_14 [L173] last_1_var_1_15 = var_1_15 [L174] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_3=17/2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L135] var_1_3 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not((var_1_3 >= -230584.3009213691390e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 2305843.009213691390e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_4=129/2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L137] var_1_4 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not((var_1_4 >= -230584.3009213691390e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 2305843.009213691390e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_5=93/10, var_1_6=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_double() [L140] 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L140] 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_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L141] var_1_8 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L144] var_1_9 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L145] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=2, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L147] var_1_11 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=128, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L150] var_1_16 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=1, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L153] var_1_17 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=16, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_18 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_18 <= 127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=2, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L159] var_1_22 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_26=47/20, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L162] var_1_26 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_27=257/4, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L164] var_1_27 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_29=0, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L166] var_1_29 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_29 >= 4611686.018427387900e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L185] RET updateVariables() [L186] CALL step() [L58] EXPR last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L58] signed long int stepLocal_1 = last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))); [L59] COND FALSE !(last_1_var_1_14 > stepLocal_1) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_25=35/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L62] COND TRUE 99.3f <= var_1_3 [L63] var_1_25 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=128, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L68] COND TRUE var_1_25 <= var_1_4 [L69] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=203/4, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L73] COND TRUE last_1_var_1_1 <= 2.25 [L74] var_1_1 = ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=32, var_1_11=127, var_1_12=638/5, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=31/2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_6=1, var_1_8=0, var_1_9=0] [L78] var_1_10 = var_1_11 [L79] var_1_12 = (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5)))) [L80] var_1_23 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_24=21/8, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L81] COND TRUE 7.75 > (- var_1_12) [L82] var_1_24 = (var_1_3 + var_1_5) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=2, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L86] var_1_30 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=-32, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L87] COND TRUE ((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5 [L88] var_1_21 = ((((var_1_22) < (5)) ? (var_1_22) : (5))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L90] COND FALSE !(var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) [L93] var_1_19 = (var_1_8 && var_1_9) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=0, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L95] COND FALSE !(var_1_24 > var_1_25) [L106] var_1_13 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L108] unsigned char stepLocal_0 = var_1_19 && var_1_8; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, stepLocal_0=0, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L109] COND FALSE !(var_1_9 || stepLocal_0) [L112] var_1_14 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=1, var_1_8=0, var_1_9=0] [L114] COND TRUE var_1_5 != (- var_1_4) [L115] var_1_6 = (var_1_19 && var_1_8) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L119] COND TRUE ((var_1_29 - 7.25f) - var_1_27) > var_1_23 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=-5, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L120] COND TRUE var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) [L121] var_1_28 = (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=2, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L132] var_1_31 = var_1_14 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR ((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L177-L178] return (((((((((((((((last_1_var_1_1 <= 2.25) ? (var_1_1 == ((double) ((((2.5) < (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))) ? (2.5) : (((var_1_3 + var_1_4) + ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))))) : (var_1_1 == ((double) ((((((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) > (var_1_4)) ? (((((7.6) > (var_1_3)) ? (7.6) : (var_1_3)))) : (var_1_4)))))) && ((var_1_5 != (- var_1_4)) ? (var_1_6 == ((unsigned char) (var_1_19 && var_1_8))) : (var_1_6 == ((unsigned char) var_1_9)))) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((double) (var_1_3 + ((((1000000.75) < (var_1_5)) ? (1000000.75) : (var_1_5))))))) && ((var_1_24 > var_1_25) ? ((var_1_19 && var_1_9) ? ((var_1_11 > last_1_var_1_13) ? (var_1_13 == ((unsigned char) var_1_11)) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11))) : (var_1_13 == ((unsigned char) var_1_11)))) && ((var_1_9 || (var_1_19 && var_1_8)) ? (var_1_14 == ((signed long int) ((((((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) < (last_1_var_1_14)) ? (((((var_1_11) > (var_1_13)) ? (var_1_11) : (var_1_13)))) : (last_1_var_1_14))))) : (var_1_14 == ((signed long int) last_1_var_1_14)))) && ((var_1_25 <= var_1_4) ? (var_1_15 == ((unsigned char) (var_1_16 - var_1_17))) : (var_1_15 == ((unsigned char) (var_1_17 + var_1_18))))) && ((var_1_17 == ((last_1_var_1_15 * var_1_16) + var_1_18)) ? (var_1_19 == ((unsigned char) (var_1_8 || var_1_9))) : (var_1_19 == ((unsigned char) (var_1_8 && var_1_9))))) && ((((((var_1_23) < (24.4f)) ? (var_1_23) : (24.4f))) != var_1_5) ? (var_1_21 == ((signed char) ((((var_1_22) < (5)) ? (var_1_22) : (5))))) : 1)) && (var_1_23 == ((double) var_1_5))) && ((7.75 > (- var_1_12)) ? (var_1_24 == ((float) (var_1_3 + var_1_5))) : (var_1_24 == ((float) ((((9999.2f) < ((var_1_5 + var_1_4))) ? (9999.2f) : ((var_1_5 + var_1_4)))))))) && ((last_1_var_1_14 > (last_1_var_1_30 | ((((var_1_17) < (var_1_11)) ? (var_1_17) : (var_1_11))))) ? (var_1_25 == ((double) ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) < (var_1_3)) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : (var_1_3))))) : ((99.3f <= var_1_3) ? (var_1_25 == ((double) (var_1_4 + var_1_5))) : (var_1_25 == ((double) (((((var_1_3 + (var_1_26 - var_1_27))) > (var_1_4)) ? ((var_1_3 + (var_1_26 - var_1_27))) : (var_1_4)))))))) && ((((var_1_29 - 7.25f) - var_1_27) > var_1_23) ? ((var_1_26 != (var_1_23 * ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29))))) ? (var_1_28 == ((signed short int) (var_1_14 + (((((var_1_16) > (var_1_13)) ? (var_1_16) : (var_1_13))) - (var_1_14 + var_1_11))))) : (var_1_28 == ((signed short int) var_1_18))) : ((var_1_12 <= var_1_23) ? (var_1_28 == ((signed short int) var_1_17)) : (var_1_28 == ((signed short int) var_1_14))))) && (var_1_30 == ((unsigned char) var_1_11))) && (var_1_31 == ((unsigned long int) var_1_14)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_14=1, last_1_var_1_15=128, last_1_var_1_1=203/4, last_1_var_1_30=2, var_1_10=127, var_1_11=127, var_1_13=127, var_1_14=1, var_1_15=125, var_1_16=127, var_1_17=258, var_1_18=0, var_1_19=0, var_1_1=5/2, var_1_21=5, var_1_22=5, var_1_23=2, var_1_28=0, var_1_30=127, var_1_31=1, var_1_5=2, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 1376 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1010 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 749 IncrementalHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 366 mSDtfsCounter, 749 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1275 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 5004 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1072 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 4961/5320 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-03 22:58:17,505 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-while_file-42.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 56ea9eca1a4d54f040375ecddb79be030f7a108b14f59fe60ae81accfdd79295 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:58:19,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:58:19,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 22:58:19,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:58:19,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:58:19,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:58:19,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:58:19,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:58:19,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:58:19,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:58:19,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:58:19,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:58:19,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:58:19,411 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 22:58:19,413 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 22:58:19,413 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 22:58:19,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:58:19,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:58:19,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:58:19,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:19,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:58:19,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:58:19,416 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 -> 56ea9eca1a4d54f040375ecddb79be030f7a108b14f59fe60ae81accfdd79295 [2025-03-03 22:58:19,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:58:19,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:58:19,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:58:19,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:58:19,644 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:58:19,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:20,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ca40e19/a267ebd69b584228aa378f7bd5f74c33/FLAG9a90f89f5 [2025-03-03 22:58:21,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:58:21,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:21,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ca40e19/a267ebd69b584228aa378f7bd5f74c33/FLAG9a90f89f5 [2025-03-03 22:58:21,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82ca40e19/a267ebd69b584228aa378f7bd5f74c33 [2025-03-03 22:58:21,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:58:21,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:58:21,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:21,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:58:21,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:58:21,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a16eb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21, skipping insertion in model container [2025-03-03 22:58:21,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:58:21,196 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i[916,929] [2025-03-03 22:58:21,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:21,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:58:21,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-42.i[916,929] [2025-03-03 22:58:21,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:58:21,313 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:58:21,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21 WrapperNode [2025-03-03 22:58:21,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:58:21,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:21,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:58:21,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:58:21,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,353 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2025-03-03 22:58:21,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:58:21,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:58:21,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:58:21,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:58:21,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,371 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-03 22:58:21,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:58:21,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:58:21,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:58:21,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:58:21,395 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (1/1) ... [2025-03-03 22:58:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:58:21,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:58:21,418 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-03 22:58:21,420 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-03 22:58:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:58:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 22:58:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:58:21,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:58:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:58:21,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:58:21,514 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:58:21,516 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:58:33,278 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:58:33,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:58:33,287 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:58:33,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:58:33,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:33 BoogieIcfgContainer [2025-03-03 22:58:33,288 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:58:33,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:58:33,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:58:33,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:58:33,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:58:21" (1/3) ... [2025-03-03 22:58:33,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a858b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:33, skipping insertion in model container [2025-03-03 22:58:33,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:21" (2/3) ... [2025-03-03 22:58:33,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a858b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:33, skipping insertion in model container [2025-03-03 22:58:33,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:33" (3/3) ... [2025-03-03 22:58:33,296 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-42.i [2025-03-03 22:58:33,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:58:33,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-42.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:58:33,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:58:33,346 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;@30290b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:58:33,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:58:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:58:33,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:33,355 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:33,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:33,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1974237710, now seen corresponding path program 1 times [2025-03-03 22:58:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:58:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394415811] [2025-03-03 22:58:33,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:33,366 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-03 22:58:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:58:33,368 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-03 22:58:33,369 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-03 22:58:33,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:58:34,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:58:34,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:34,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:58:34,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 22:58:34,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:58:34,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:58:34,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394415811] [2025-03-03 22:58:34,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394415811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:58:34,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:58:34,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 22:58:34,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904972596] [2025-03-03 22:58:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:58:34,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:58:34,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:58:34,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:58:34,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:58:34,191 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:58:34,208 INFO L93 Difference]: Finished difference Result 134 states and 227 transitions. [2025-03-03 22:58:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:58:34,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2025-03-03 22:58:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:58:34,213 INFO L225 Difference]: With dead ends: 134 [2025-03-03 22:58:34,213 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 22:58:34,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-03 22:58:34,217 INFO L435 NwaCegarLoop]: 101 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, 101 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-03 22:58:34,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:58:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 22:58:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-03 22:58:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 22:58:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-03 22:58:34,248 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 137 [2025-03-03 22:58:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:58:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-03 22:58:34,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 22:58:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2025-03-03 22:58:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 22:58:34,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:58:34,250 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:34,279 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-03 22:58:34,451 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-03 22:58:34,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:58:34,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:58:34,452 INFO L85 PathProgramCache]: Analyzing trace with hash 204686926, now seen corresponding path program 1 times [2025-03-03 22:58:34,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:58:34,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908570086] [2025-03-03 22:58:34,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:58:34,452 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-03 22:58:34,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:58:34,455 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-03 22:58:34,456 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-03 22:58:34,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 22:58:35,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 22:58:35,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:58:35,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:58:35,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:58:35,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:58:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:58:40,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:58:40,647 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:58:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908570086] [2025-03-03 22:58:40,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908570086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:58:40,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:58:40,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 22:58:40,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576791316] [2025-03-03 22:58:40,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:58:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:58:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:58:40,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:58:40,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:58:40,649 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:58:45,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:58:49,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:58:53,830 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 [0] [2025-03-03 22:58:57,839 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-03 22:59:02,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:06,321 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 [0] [2025-03-03 22:59:10,324 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-03 22:59:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:59:10,325 INFO L93 Difference]: Finished difference Result 196 states and 298 transitions. [2025-03-03 22:59:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:59:10,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 22:59:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:59:10,450 INFO L225 Difference]: With dead ends: 196 [2025-03-03 22:59:10,450 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 22:59:10,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:59:10,451 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 41 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2025-03-03 22:59:10,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 330 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 65 Invalid, 6 Unknown, 0 Unchecked, 29.3s Time] [2025-03-03 22:59:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 22:59:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 107. [2025-03-03 22:59:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 22:59:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 160 transitions. [2025-03-03 22:59:10,475 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 160 transitions. Word has length 137 [2025-03-03 22:59:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:59:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 160 transitions. [2025-03-03 22:59:10,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:59:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 160 transitions. [2025-03-03 22:59:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 22:59:10,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:59:10,477 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:59:10,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 22:59:10,678 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-03 22:59:10,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:59:10,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:59:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -541178790, now seen corresponding path program 1 times [2025-03-03 22:59:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 22:59:10,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306378856] [2025-03-03 22:59:10,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:59:10,679 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-03 22:59:10,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 22:59:10,681 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-03 22:59:10,682 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-03 22:59:10,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 22:59:11,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 22:59:11,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:59:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:59:11,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 22:59:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:59:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 22:59:14,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:59:14,737 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 22:59:14,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306378856] [2025-03-03 22:59:14,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306378856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:59:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:59:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:59:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671019450] [2025-03-03 22:59:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:59:14,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 22:59:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 22:59:14,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 22:59:14,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 22:59:14,738 INFO L87 Difference]: Start difference. First operand 107 states and 160 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 22:59:16,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:20,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:23,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:27,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:31,404 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-03 22:59:35,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:39,730 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-03 22:59:42,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:44,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 22:59:46,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []