./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_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_fillercode_fillercodestructure_filler-pe-co_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 c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:51:57,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:51:57,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:51:57,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:51:57,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:51:57,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:51:57,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:51:57,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:51:57,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:51:57,934 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:51:57,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:51:57,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:51:57,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:51:57,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:51:57,935 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:51:57,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:51:57,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:51:57,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:51:57,937 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:51:57,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:51:57,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:51:57,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:51:57,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:51:57,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:51:57,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:51:57,938 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 -> c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b [2025-03-03 20:51:58,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:51:58,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:51:58,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:51:58,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:51:58,163 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:51:58,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:51:59,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615cd18/6db88b4fd9ea4317be243c453eda7c79/FLAG9584de738 [2025-03-03 20:51:59,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:51:59,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:51:59,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615cd18/6db88b4fd9ea4317be243c453eda7c79/FLAG9584de738 [2025-03-03 20:51:59,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c615cd18/6db88b4fd9ea4317be243c453eda7c79 [2025-03-03 20:51:59,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:51:59,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:51:59,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:51:59,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:51:59,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:51:59,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59, skipping insertion in model container [2025-03-03 20:51:59,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:51:59,704 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_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2025-03-03 20:51:59,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:51:59,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:51:59,765 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_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2025-03-03 20:51:59,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:51:59,814 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:51:59,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59 WrapperNode [2025-03-03 20:51:59,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:51:59,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:51:59,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:51:59,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:51:59,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,825 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,853 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2025-03-03 20:51:59,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:51:59,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:51:59,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:51:59,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:51:59,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,886 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 20:51:59,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:51:59,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:51:59,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:51:59,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:51:59,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (1/1) ... [2025-03-03 20:51:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:51:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:51:59,926 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 20:51:59,928 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 20:51:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:51:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:51:59,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:51:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:51:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:51:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:52:00,000 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:52:00,002 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:52:00,363 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:52:00,364 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:52:00,372 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:52:00,373 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:52:00,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:52:00 BoogieIcfgContainer [2025-03-03 20:52:00,374 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:52:00,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:52:00,376 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:52:00,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:52:00,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:51:59" (1/3) ... [2025-03-03 20:52:00,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:52:00, skipping insertion in model container [2025-03-03 20:52:00,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:59" (2/3) ... [2025-03-03 20:52:00,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cdac34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:52:00, skipping insertion in model container [2025-03-03 20:52:00,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:52:00" (3/3) ... [2025-03-03 20:52:00,382 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:52:00,391 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:52:00,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:52:00,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:52:00,450 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;@2b4129d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:52:00,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:52:00,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 20:52:00,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 20:52:00,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:00,462 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:00,463 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:00,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 867416532, now seen corresponding path program 1 times [2025-03-03 20:52:00,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:00,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046436646] [2025-03-03 20:52:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:00,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 20:52:00,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 20:52:00,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:00,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 20:52:00,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:00,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046436646] [2025-03-03 20:52:00,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046436646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127115432] [2025-03-03 20:52:00,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:00,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:00,744 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 20:52:00,745 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 20:52:00,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 20:52:00,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 20:52:00,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:00,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:00,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:52:00,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-03 20:52:00,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127115432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:00,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:52:00,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:52:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051559174] [2025-03-03 20:52:00,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:00,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:52:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:00,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:52:00,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:52:00,968 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:00,991 INFO L93 Difference]: Finished difference Result 170 states and 302 transitions. [2025-03-03 20:52:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:52:00,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-03 20:52:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:00,996 INFO L225 Difference]: With dead ends: 170 [2025-03-03 20:52:00,996 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 20:52:00,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 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 20:52:01,000 INFO L435 NwaCegarLoop]: 132 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, 132 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 20:52:01,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:52:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 20:52:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 20:52:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 20:52:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 20:52:01,030 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 190 [2025-03-03 20:52:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:01,030 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 20:52:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 20:52:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 20:52:01,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:01,033 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:01,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:52:01,233 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 20:52:01,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:01,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:01,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1008163622, now seen corresponding path program 1 times [2025-03-03 20:52:01,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:01,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563526357] [2025-03-03 20:52:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:01,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 20:52:01,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 20:52:01,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:01,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563526357] [2025-03-03 20:52:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563526357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:01,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:52:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595634739] [2025-03-03 20:52:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:52:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:01,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:52:01,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:52:01,666 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:01,856 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-03 20:52:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:52:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-03 20:52:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:01,860 INFO L225 Difference]: With dead ends: 250 [2025-03-03 20:52:01,861 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 20:52:01,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:52:01,863 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 97 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:01,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 376 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:52:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 20:52:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-03-03 20:52:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 20:52:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2025-03-03 20:52:01,884 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 190 [2025-03-03 20:52:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:01,884 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2025-03-03 20:52:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2025-03-03 20:52:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:01,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:01,886 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:52:01,887 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash -467999055, now seen corresponding path program 1 times [2025-03-03 20:52:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-03 20:52:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:01,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:01,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:01,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:01,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:01,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496347568] [2025-03-03 20:52:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496347568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:52:02,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208765153] [2025-03-03 20:52:02,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:52:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:02,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:52:02,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:52:02,250 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:02,558 INFO L93 Difference]: Finished difference Result 375 states and 591 transitions. [2025-03-03 20:52:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:52:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:02,562 INFO L225 Difference]: With dead ends: 375 [2025-03-03 20:52:02,564 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 20:52:02,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:52:02,565 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 163 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 589 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:52:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 20:52:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 217. [2025-03-03 20:52:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 20:52:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2025-03-03 20:52:02,612 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 191 [2025-03-03 20:52:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:02,613 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2025-03-03 20:52:02,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2025-03-03 20:52:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:02,616 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:52:02,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -535005808, now seen corresponding path program 1 times [2025-03-03 20:52:02,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:02,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087939712] [2025-03-03 20:52:02,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:02,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:02,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:02,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:02,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:02,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:02,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:02,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087939712] [2025-03-03 20:52:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087939712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:52:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596532440] [2025-03-03 20:52:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:52:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:02,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:52:02,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:52:02,831 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:02,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:02,891 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2025-03-03 20:52:02,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:52:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:02,895 INFO L225 Difference]: With dead ends: 379 [2025-03-03 20:52:02,896 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 20:52:02,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:52:02,897 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:02,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:52:02,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 20:52:02,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-03 20:52:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 20:52:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 337 transitions. [2025-03-03 20:52:02,930 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 337 transitions. Word has length 191 [2025-03-03 20:52:02,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:02,931 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 337 transitions. [2025-03-03 20:52:02,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 337 transitions. [2025-03-03 20:52:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:02,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:02,933 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:02,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:52:02,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:02,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1532078161, now seen corresponding path program 1 times [2025-03-03 20:52:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:02,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440929110] [2025-03-03 20:52:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:02,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:03,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:03,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:03,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2025-03-03 20:52:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440929110] [2025-03-03 20:52:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440929110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712600728] [2025-03-03 20:52:03,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:03,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:03,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:03,521 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 20:52:03,523 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 20:52:03,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:03,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:03,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:03,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:03,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 20:52:03,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-03-03 20:52:04,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-03 20:52:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712600728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:52:05,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:52:05,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 23 [2025-03-03 20:52:05,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548025041] [2025-03-03 20:52:05,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:52:05,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 20:52:05,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:05,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 20:52:05,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-03-03 20:52:05,200 INFO L87 Difference]: Start difference. First operand 217 states and 337 transitions. Second operand has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-03 20:52:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:06,878 INFO L93 Difference]: Finished difference Result 758 states and 1120 transitions. [2025-03-03 20:52:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-03 20:52:06,880 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 191 [2025-03-03 20:52:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:06,883 INFO L225 Difference]: With dead ends: 758 [2025-03-03 20:52:06,885 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 20:52:06,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1018, Invalid=4532, Unknown=0, NotChecked=0, Total=5550 [2025-03-03 20:52:06,889 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 721 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:06,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1732 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:52:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 20:52:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 338. [2025-03-03 20:52:06,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.277511961722488) internal successors, (267), 209 states have internal predecessors, (267), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-03 20:52:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 499 transitions. [2025-03-03 20:52:06,931 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 499 transitions. Word has length 191 [2025-03-03 20:52:06,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:06,931 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 499 transitions. [2025-03-03 20:52:06,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.913043478260869) internal successors, (113), 23 states have internal predecessors, (113), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2025-03-03 20:52:06,931 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 499 transitions. [2025-03-03 20:52:06,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:06,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:06,933 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:06,939 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 20:52:07,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:07,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:07,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash -287313680, now seen corresponding path program 1 times [2025-03-03 20:52:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212343896] [2025-03-03 20:52:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:07,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:07,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:07,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:07,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:52:07,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [643299062] [2025-03-03 20:52:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:07,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:07,234 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 20:52:07,242 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 20:52:07,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:07,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:07,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:07,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:07,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 20:52:07,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:52:08,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212343896] [2025-03-03 20:52:08,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:52:08,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643299062] [2025-03-03 20:52:08,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643299062] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:08,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:52:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-03 20:52:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954170761] [2025-03-03 20:52:08,528 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 20:52:08,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:52:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:08,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:52:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:52:08,529 INFO L87 Difference]: Start difference. First operand 338 states and 499 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:09,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:09,046 INFO L93 Difference]: Finished difference Result 1093 states and 1593 transitions. [2025-03-03 20:52:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 20:52:09,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2025-03-03 20:52:09,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:09,052 INFO L225 Difference]: With dead ends: 1093 [2025-03-03 20:52:09,052 INFO L226 Difference]: Without dead ends: 828 [2025-03-03 20:52:09,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-03-03 20:52:09,054 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 195 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:09,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 939 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:52:09,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2025-03-03 20:52:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 681. [2025-03-03 20:52:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 446 states have (on average 1.2869955156950672) internal successors, (574), 448 states have internal predecessors, (574), 207 states have call successors, (207), 27 states have call predecessors, (207), 27 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-03 20:52:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 988 transitions. [2025-03-03 20:52:09,113 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 988 transitions. Word has length 191 [2025-03-03 20:52:09,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:09,113 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 988 transitions. [2025-03-03 20:52:09,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:09,114 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 988 transitions. [2025-03-03 20:52:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:09,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:09,116 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:09,123 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 20:52:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:09,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1969597327, now seen corresponding path program 1 times [2025-03-03 20:52:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723000732] [2025-03-03 20:52:09,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:09,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:09,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:09,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:09,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:52:09,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595951025] [2025-03-03 20:52:09,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:09,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:09,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:09,373 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 20:52:09,375 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 20:52:09,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:09,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:09,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:09,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:09,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 20:52:09,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:52:10,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:10,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723000732] [2025-03-03 20:52:10,959 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:52:10,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595951025] [2025-03-03 20:52:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595951025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:10,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:52:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-03-03 20:52:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573829442] [2025-03-03 20:52:10,959 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 20:52:10,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:52:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:10,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:52:10,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:52:10,960 INFO L87 Difference]: Start difference. First operand 681 states and 988 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:11,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:11,635 INFO L93 Difference]: Finished difference Result 1381 states and 2024 transitions. [2025-03-03 20:52:11,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:52:11,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2025-03-03 20:52:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:11,642 INFO L225 Difference]: With dead ends: 1381 [2025-03-03 20:52:11,642 INFO L226 Difference]: Without dead ends: 1112 [2025-03-03 20:52:11,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-03 20:52:11,643 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 250 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:11,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1047 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:52:11,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-03-03 20:52:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 862. [2025-03-03 20:52:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 561 states have (on average 1.2780748663101604) internal successors, (717), 563 states have internal predecessors, (717), 265 states have call successors, (265), 35 states have call predecessors, (265), 35 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2025-03-03 20:52:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1247 transitions. [2025-03-03 20:52:11,725 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1247 transitions. Word has length 191 [2025-03-03 20:52:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 862 states and 1247 transitions. [2025-03-03 20:52:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1247 transitions. [2025-03-03 20:52:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 20:52:11,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:11,727 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:11,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:52:11,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:11,928 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:11,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1678007398, now seen corresponding path program 1 times [2025-03-03 20:52:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:52:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31533330] [2025-03-03 20:52:11,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:52:11,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 20:52:12,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 20:52:12,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:12,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:52:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [410162042] [2025-03-03 20:52:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:12,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:52:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:52:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 20:52:12,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 20:52:12,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:12,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:52:12,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:52:12,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 20:52:12,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 20:52:12,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:52:12,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:52:12,236 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:52:12,237 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:52:12,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 20:52:12,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:52:12,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:52:12,534 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:52:12,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:52:12 BoogieIcfgContainer [2025-03-03 20:52:12,537 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:52:12,538 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:52:12,538 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:52:12,538 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:52:12,539 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:52:00" (3/4) ... [2025-03-03 20:52:12,541 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:52:12,542 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:52:12,542 INFO L158 Benchmark]: Toolchain (without parser) took 12970.68ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 104.3MB in the beginning and 270.7MB in the end (delta: -166.4MB). Peak memory consumption was 82.5MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,543 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:52:12,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.45ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 87.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.00ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 83.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,544 INFO L158 Benchmark]: Boogie Preprocessor took 47.12ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 78.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:52:12,544 INFO L158 Benchmark]: IcfgBuilder took 472.07ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 51.3MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,544 INFO L158 Benchmark]: TraceAbstraction took 12162.13ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 50.3MB in the beginning and 270.8MB in the end (delta: -220.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,544 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 385.9MB. Free memory was 270.8MB in the beginning and 270.7MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:52:12,546 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.45ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 87.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.00ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 83.8MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.12ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 78.3MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 472.07ms. Allocated memory is still 142.6MB. Free memory was 78.3MB in the beginning and 51.3MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12162.13ms. Allocated memory was 142.6MB in the beginning and 385.9MB in the end (delta: 243.3MB). Free memory was 50.3MB in the beginning and 270.8MB in the end (delta: -220.5MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 385.9MB. Free memory was 270.8MB in the beginning and 270.7MB in the end (delta: 120.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 116. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; VAL [isInitial=0, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] signed long int stepLocal_6 = last_1_var_1_1; [L62] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L63] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L64] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L67] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L72] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=10, var_1_7=-55, var_1_8=1] [L75] COND TRUE var_1_5 >= -2 [L76] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L78] unsigned char stepLocal_4 = var_1_6; [L79] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L80] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=101, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L81] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L82] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L89] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L90] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L93] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L94] COND TRUE \read(var_1_19) [L95] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L101] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L102] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=1] [L103] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L110] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L112] COND TRUE var_1_19 || var_1_8 [L113] var_1_21 = ((var_1_13 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L115] COND TRUE ((var_1_13 + 25) % var_1_27) < 2 [L116] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L118] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L119] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L121] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_13)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_13))) <= var_1_13 [L122] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L124] COND FALSE !(var_1_6 < ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L127] COND TRUE \read(var_1_25) [L128] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L130] COND TRUE \read(var_1_25) [L131] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L135] COND TRUE (- var_1_17) != var_1_17 [L136] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L138] COND FALSE !(var_1_33 <= (~ var_1_13)) [L143] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=101, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=101, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=225, var_1_29=3, var_1_30=3, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=101, var_1_42=32767, var_1_5=100, var_1_6=101, var_1_7=-55, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1457 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1426 mSDsluCounter, 5063 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3862 mSDsCounter, 626 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2882 IncrementalHoareTripleChecker+Invalid, 3508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 626 mSolverCounterUnsat, 1201 mSDtfsCounter, 2882 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1403 GetRequests, 1273 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=862occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 842 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2482 NumberOfCodeBlocks, 2482 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1897 ConstructedInterpolants, 2 QuantifiedInterpolants, 9071 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1818 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 15692/16240 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 20:52:12,577 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_fillercode_fillercodestructure_filler-pe-co_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 c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:52:14,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:52:14,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:52:14,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:52:14,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:52:14,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:52:14,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:52:14,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:52:14,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:52:14,436 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:52:14,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:52:14,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:52:14,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:52:14,437 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:52:14,438 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:52:14,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:52:14,438 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:52:14,439 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:52:14,439 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:52:14,439 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:52:14,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:52:14,439 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 -> c6501e0794616ec0486fa8dfdbb7418c6408937fb63a44ca47f9c4c2f7c3791b [2025-03-03 20:52:14,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:52:14,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:52:14,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:52:14,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:52:14,665 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:52:14,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:52:15,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d982b1d0/95d8499132d94b5d9d4fd8d3242825e6/FLAG282d95b02 [2025-03-03 20:52:16,032 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:52:16,034 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:52:16,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d982b1d0/95d8499132d94b5d9d4fd8d3242825e6/FLAG282d95b02 [2025-03-03 20:52:16,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d982b1d0/95d8499132d94b5d9d4fd8d3242825e6 [2025-03-03 20:52:16,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:52:16,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:52:16,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:52:16,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:52:16,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:52:16,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e291be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16, skipping insertion in model container [2025-03-03 20:52:16,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:52:16,188 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_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2025-03-03 20:52:16,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:52:16,265 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:52:16,272 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_fillercode_fillercodestructure_filler-pe-co_file-42.i[919,932] [2025-03-03 20:52:16,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:52:16,314 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:52:16,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16 WrapperNode [2025-03-03 20:52:16,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:52:16,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:52:16,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:52:16,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:52:16,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,356 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-03-03 20:52:16,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:52:16,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:52:16,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:52:16,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:52:16,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,389 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 20:52:16,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,403 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:52:16,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:52:16,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:52:16,417 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:52:16,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (1/1) ... [2025-03-03 20:52:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:52:16,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:52:16,447 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 20:52:16,450 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 20:52:16,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:52:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:52:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:52:16,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:52:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:52:16,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:52:16,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:52:16,537 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:52:17,092 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:52:17,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:52:17,099 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:52:17,100 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:52:17,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:52:17 BoogieIcfgContainer [2025-03-03 20:52:17,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:52:17,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:52:17,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:52:17,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:52:17,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:52:16" (1/3) ... [2025-03-03 20:52:17,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32626e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:52:17, skipping insertion in model container [2025-03-03 20:52:17,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:52:16" (2/3) ... [2025-03-03 20:52:17,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32626e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:52:17, skipping insertion in model container [2025-03-03 20:52:17,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:52:17" (3/3) ... [2025-03-03 20:52:17,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i [2025-03-03 20:52:17,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:52:17,117 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-42.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:52:17,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:52:17,161 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;@3e70bd0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:52:17,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:52:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 20:52:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 20:52:17,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:17,175 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:17,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:17,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:17,179 INFO L85 PathProgramCache]: Analyzing trace with hash 867416532, now seen corresponding path program 1 times [2025-03-03 20:52:17,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:17,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612136464] [2025-03-03 20:52:17,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:17,188 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 20:52:17,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:17,190 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 20:52:17,191 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 20:52:17,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 20:52:17,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 20:52:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:17,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:52:17,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-03-03 20:52:17,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:17,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612136464] [2025-03-03 20:52:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612136464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:17,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:17,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:52:17,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672984414] [2025-03-03 20:52:17,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:17,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:52:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:17,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:52:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:52:17,589 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:17,617 INFO L93 Difference]: Finished difference Result 170 states and 302 transitions. [2025-03-03 20:52:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:52:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-03 20:52:17,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:17,624 INFO L225 Difference]: With dead ends: 170 [2025-03-03 20:52:17,625 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 20:52:17,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 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 20:52:17,631 INFO L435 NwaCegarLoop]: 132 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, 132 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 20:52:17,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:52:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 20:52:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-03 20:52:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-03 20:52:17,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-03 20:52:17,666 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 190 [2025-03-03 20:52:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:17,666 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-03 20:52:17,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-03 20:52:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-03 20:52:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-03 20:52:17,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:17,670 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:17,682 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 20:52:17,870 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 20:52:17,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:17,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1008163622, now seen corresponding path program 1 times [2025-03-03 20:52:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001284803] [2025-03-03 20:52:17,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:17,874 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 20:52:17,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:17,876 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 20:52:17,877 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 20:52:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-03 20:52:18,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-03 20:52:18,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:18,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:18,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:52:18,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:18,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:18,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001284803] [2025-03-03 20:52:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001284803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:52:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588250233] [2025-03-03 20:52:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:52:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:52:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:52:18,501 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:18,787 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-03 20:52:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:52:18,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-03 20:52:18,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:18,797 INFO L225 Difference]: With dead ends: 250 [2025-03-03 20:52:18,797 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 20:52:18,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:52:18,798 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 94 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:18,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 376 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:52:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 20:52:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 137. [2025-03-03 20:52:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 76 states have (on average 1.263157894736842) internal successors, (96), 76 states have internal predecessors, (96), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 20:52:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2025-03-03 20:52:18,821 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 190 [2025-03-03 20:52:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:18,822 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2025-03-03 20:52:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2025-03-03 20:52:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:18,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:18,826 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:18,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:52:19,029 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 20:52:19,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash -467999055, now seen corresponding path program 1 times [2025-03-03 20:52:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:19,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810673752] [2025-03-03 20:52:19,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:19,031 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 20:52:19,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:19,033 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 20:52:19,033 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 20:52:19,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:19,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:19,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:19,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:52:19,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:20,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:20,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:20,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810673752] [2025-03-03 20:52:20,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810673752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:20,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:20,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:52:20,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711302696] [2025-03-03 20:52:20,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:52:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:20,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:52:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:52:20,036 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:20,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:20,722 INFO L93 Difference]: Finished difference Result 375 states and 591 transitions. [2025-03-03 20:52:20,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:52:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:20,730 INFO L225 Difference]: With dead ends: 375 [2025-03-03 20:52:20,730 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 20:52:20,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:52:20,731 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 160 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:20,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 584 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:52:20,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 20:52:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 217. [2025-03-03 20:52:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 126 states have internal predecessors, (165), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 20:52:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2025-03-03 20:52:20,774 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 191 [2025-03-03 20:52:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2025-03-03 20:52:20,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2025-03-03 20:52:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:20,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:20,780 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:20,792 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 (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:52:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 20:52:20,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -535005808, now seen corresponding path program 1 times [2025-03-03 20:52:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431798400] [2025-03-03 20:52:20,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:20,982 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 20:52:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:20,983 INFO L229 MonitoredProcess]: Starting monitored process 5 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 20:52:20,987 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 (5)] Waiting until timeout for monitored process [2025-03-03 20:52:21,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:21,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:21,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:21,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:21,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:52:21,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:21,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:21,281 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:21,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431798400] [2025-03-03 20:52:21,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431798400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:21,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:21,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:52:21,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967091079] [2025-03-03 20:52:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:21,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:52:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:21,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:52:21,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:52:21,283 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:21,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:21,390 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2025-03-03 20:52:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:52:21,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:21,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:21,401 INFO L225 Difference]: With dead ends: 379 [2025-03-03 20:52:21,402 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 20:52:21,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:52:21,403 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:21,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:52:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 20:52:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-03 20:52:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-03 20:52:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 337 transitions. [2025-03-03 20:52:21,434 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 337 transitions. Word has length 191 [2025-03-03 20:52:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:21,436 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 337 transitions. [2025-03-03 20:52:21,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 337 transitions. [2025-03-03 20:52:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:21,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:21,439 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:21,449 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 (5)] Forceful destruction successful, exit code 0 [2025-03-03 20:52:21,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 20:52:21,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:21,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1532078161, now seen corresponding path program 1 times [2025-03-03 20:52:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:21,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876399420] [2025-03-03 20:52:21,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:21,641 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 20:52:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:21,644 INFO L229 MonitoredProcess]: Starting monitored process 6 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 20:52:21,644 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 (6)] Waiting until timeout for monitored process [2025-03-03 20:52:21,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:21,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:21,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:21,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:21,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:52:21,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:22,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2025-03-03 20:52:22,248 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-03 20:52:22,599 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876399420] [2025-03-03 20:52:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876399420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:52:22,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:52:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-03 20:52:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130398387] [2025-03-03 20:52:22,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:52:22,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:52:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:22,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:52:22,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:52:22,601 INFO L87 Difference]: Start difference. First operand 217 states and 337 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 20:52:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:23,566 INFO L93 Difference]: Finished difference Result 446 states and 654 transitions. [2025-03-03 20:52:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 20:52:23,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 191 [2025-03-03 20:52:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:23,569 INFO L225 Difference]: With dead ends: 446 [2025-03-03 20:52:23,569 INFO L226 Difference]: Without dead ends: 364 [2025-03-03 20:52:23,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 20:52:23,570 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 144 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:23,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 719 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:52:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-03 20:52:23,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2025-03-03 20:52:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 209 states have (on average 1.277511961722488) internal successors, (267), 209 states have internal predecessors, (267), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-03 20:52:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 499 transitions. [2025-03-03 20:52:23,594 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 499 transitions. Word has length 191 [2025-03-03 20:52:23,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:23,595 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 499 transitions. [2025-03-03 20:52:23,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-03 20:52:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 499 transitions. [2025-03-03 20:52:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:23,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:23,596 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:23,606 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 (6)] Forceful destruction successful, exit code 0 [2025-03-03 20:52:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 20:52:23,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -287313680, now seen corresponding path program 1 times [2025-03-03 20:52:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494921925] [2025-03-03 20:52:23,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:23,798 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 20:52:23,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:23,799 INFO L229 MonitoredProcess]: Starting monitored process 7 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 20:52:23,801 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 (7)] Waiting until timeout for monitored process [2025-03-03 20:52:23,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:24,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:24,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:24,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:52:24,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:52:24,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:24,908 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494921925] [2025-03-03 20:52:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494921925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [899369986] [2025-03-03 20:52:24,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:24,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:52:24,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:52:24,932 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:52:24,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 20:52:24,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:25,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:25,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:25,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:25,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:52:25,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:25,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:25,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:25,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [899369986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:25,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:52:25,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-03 20:52:25,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919196101] [2025-03-03 20:52:25,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:25,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:52:25,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:25,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:52:25,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:52:25,959 INFO L87 Difference]: Start difference. First operand 338 states and 499 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:27,780 INFO L93 Difference]: Finished difference Result 1053 states and 1557 transitions. [2025-03-03 20:52:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:52:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:27,790 INFO L225 Difference]: With dead ends: 1053 [2025-03-03 20:52:27,790 INFO L226 Difference]: Without dead ends: 788 [2025-03-03 20:52:27,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:52:27,791 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 190 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:27,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 638 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:52:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-03 20:52:27,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 665. [2025-03-03 20:52:27,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 434 states have (on average 1.294930875576037) internal successors, (562), 436 states have internal predecessors, (562), 207 states have call successors, (207), 23 states have call predecessors, (207), 23 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2025-03-03 20:52:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 976 transitions. [2025-03-03 20:52:27,844 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 976 transitions. Word has length 191 [2025-03-03 20:52:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:27,844 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 976 transitions. [2025-03-03 20:52:27,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 976 transitions. [2025-03-03 20:52:27,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 20:52:27,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:27,846 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:27,856 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 (7)] Forceful destruction successful, exit code 0 [2025-03-03 20:52:28,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 20:52:28,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 20:52:28,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:28,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1969597327, now seen corresponding path program 1 times [2025-03-03 20:52:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:28,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696444343] [2025-03-03 20:52:28,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:28,247 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 20:52:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:28,249 INFO L229 MonitoredProcess]: Starting monitored process 9 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 20:52:28,250 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 (9)] Waiting until timeout for monitored process [2025-03-03 20:52:28,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:28,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:28,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:28,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:28,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:52:28,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-03-03 20:52:29,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:52:29,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:52:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696444343] [2025-03-03 20:52:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696444343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:52:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [355551232] [2025-03-03 20:52:29,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:29,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 20:52:29,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 20:52:29,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 20:52:29,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 20:52:29,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 20:52:29,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 20:52:29,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:29,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:29,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:52:29,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:52:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-03 20:52:30,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:52:30,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [355551232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:30,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:52:30,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-03 20:52:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883416323] [2025-03-03 20:52:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:30,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:52:30,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:52:30,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:52:30,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:52:30,607 INFO L87 Difference]: Start difference. First operand 665 states and 976 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:52:32,346 INFO L93 Difference]: Finished difference Result 1179 states and 1739 transitions. [2025-03-03 20:52:32,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:52:32,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-03-03 20:52:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:52:32,355 INFO L225 Difference]: With dead ends: 1179 [2025-03-03 20:52:32,355 INFO L226 Difference]: Without dead ends: 910 [2025-03-03 20:52:32,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:52:32,357 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 108 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:52:32,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 543 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:52:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2025-03-03 20:52:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 838. [2025-03-03 20:52:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 543 states have (on average 1.287292817679558) internal successors, (699), 545 states have internal predecessors, (699), 265 states have call successors, (265), 29 states have call predecessors, (265), 29 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2025-03-03 20:52:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1229 transitions. [2025-03-03 20:52:32,423 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1229 transitions. Word has length 191 [2025-03-03 20:52:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:52:32,423 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1229 transitions. [2025-03-03 20:52:32,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-03 20:52:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1229 transitions. [2025-03-03 20:52:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 20:52:32,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:52:32,424 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:52:32,434 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 (9)] Ended with exit code 0 [2025-03-03 20:52:32,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-03 20:52:32,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 20:52:32,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:52:32,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:52:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1678007398, now seen corresponding path program 1 times [2025-03-03 20:52:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:52:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26383142] [2025-03-03 20:52:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:52:32,826 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 20:52:32,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:52:32,827 INFO L229 MonitoredProcess]: Starting monitored process 11 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 20:52:32,828 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 (11)] Waiting until timeout for monitored process [2025-03-03 20:52:32,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 20:52:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 20:52:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:52:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:33,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-03 20:52:33,067 INFO L279 TraceCheckSpWp]: Computing forward predicates...