./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.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_fillercodesize_ps-cn-10_file-79.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 c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:40:25,644 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:40:25,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:40:25,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:40:25,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:40:25,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:40:25,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:40:25,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:40:25,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:40:25,724 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:40:25,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:40:25,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:40:25,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:40:25,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:40:25,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:40:25,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:40:25,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:40:25,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:40:25,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:25,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:40:25,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:40:25,728 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 -> c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 [2025-03-03 19:40:25,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:40:25,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:40:25,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:40:25,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:40:25,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:40:25,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:27,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6095a008/302a58e2b69643d7902449b2bbf5cbb3/FLAG5ce71f3cc [2025-03-03 19:40:27,409 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:40:27,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:27,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6095a008/302a58e2b69643d7902449b2bbf5cbb3/FLAG5ce71f3cc [2025-03-03 19:40:27,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6095a008/302a58e2b69643d7902449b2bbf5cbb3 [2025-03-03 19:40:27,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:40:27,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:40:27,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:27,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:40:27,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:40:27,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:27,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bde12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27, skipping insertion in model container [2025-03-03 19:40:27,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:27,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:40:27,810 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_fillercodesize_ps-cn-10_file-79.i[915,928] [2025-03-03 19:40:27,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:27,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:40:27,913 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_fillercodesize_ps-cn-10_file-79.i[915,928] [2025-03-03 19:40:27,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:27,961 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:40:27,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27 WrapperNode [2025-03-03 19:40:27,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:27,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:27,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:40:27,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:40:27,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:27,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,010 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-03 19:40:28,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:28,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:40:28,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:40:28,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:40:28,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,048 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 19:40:28,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,051 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,062 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:40:28,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:40:28,077 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:40:28,077 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:40:28,078 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (1/1) ... [2025-03-03 19:40:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:28,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:28,107 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 19:40:28,109 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 19:40:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:40:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:40:28,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:40:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:40:28,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:40:28,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:40:28,196 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:40:28,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:40:28,556 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:40:28,556 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:40:28,563 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:40:28,563 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:40:28,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:28 BoogieIcfgContainer [2025-03-03 19:40:28,564 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:40:28,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:40:28,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:40:28,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:40:28,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:40:27" (1/3) ... [2025-03-03 19:40:28,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321764f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:28, skipping insertion in model container [2025-03-03 19:40:28,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:27" (2/3) ... [2025-03-03 19:40:28,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321764f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:28, skipping insertion in model container [2025-03-03 19:40:28,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:28" (3/3) ... [2025-03-03 19:40:28,571 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:28,581 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:40:28,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:40:28,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:40:28,651 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;@d838489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:40:28,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:40:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 50 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 19:40:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:40:28,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:28,669 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:28,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:28,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 885902974, now seen corresponding path program 1 times [2025-03-03 19:40:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058494296] [2025-03-03 19:40:28,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:28,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:28,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:40:28,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:40:28,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 19:40:28,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:28,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058494296] [2025-03-03 19:40:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058494296] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:40:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599394986] [2025-03-03 19:40:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:28,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:28,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:28,952 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 19:40:28,954 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 19:40:29,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:40:29,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:40:29,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:29,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:40:29,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 19:40:29,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:29,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599394986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:29,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:40:29,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:40:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334646845] [2025-03-03 19:40:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:29,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:40:29,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:40:29,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:29,222 INFO L87 Difference]: Start difference. First operand has 86 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 50 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 19:40:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:29,245 INFO L93 Difference]: Finished difference Result 166 states and 293 transitions. [2025-03-03 19:40:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:40:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2025-03-03 19:40:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:29,254 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:40:29,254 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:40:29,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 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 19:40:29,262 INFO L435 NwaCegarLoop]: 127 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, 127 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 19:40:29,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:40:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:40:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 19:40:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-03-03 19:40:29,306 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 209 [2025-03-03 19:40:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:29,306 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-03-03 19:40:29,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 19:40:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-03-03 19:40:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:40:29,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:29,310 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:29,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:40:29,510 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 19:40:29,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:29,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash 853942084, now seen corresponding path program 1 times [2025-03-03 19:40:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95076469] [2025-03-03 19:40:29,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:29,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:40:29,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:40:29,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:29,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:29,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95076469] [2025-03-03 19:40:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95076469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:40:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222499779] [2025-03-03 19:40:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:29,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:40:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:29,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:40:29,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:29,880 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:29,937 INFO L93 Difference]: Finished difference Result 243 states and 375 transitions. [2025-03-03 19:40:29,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:40:29,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 209 [2025-03-03 19:40:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:29,942 INFO L225 Difference]: With dead ends: 243 [2025-03-03 19:40:29,943 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 19:40:29,944 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 19:40:29,945 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:29,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 248 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 19:40:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-03-03 19:40:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:40:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 248 transitions. [2025-03-03 19:40:29,981 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 248 transitions. Word has length 209 [2025-03-03 19:40:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:29,983 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 248 transitions. [2025-03-03 19:40:29,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2025-03-03 19:40:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 19:40:29,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:29,987 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:29,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:40:29,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:29,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1544099520, now seen corresponding path program 1 times [2025-03-03 19:40:29,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:29,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173149506] [2025-03-03 19:40:29,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:30,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 19:40:30,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 19:40:30,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:30,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173149506] [2025-03-03 19:40:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173149506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:30,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:30,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:40:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880382724] [2025-03-03 19:40:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:40:30,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:30,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:40:30,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:40:30,377 INFO L87 Difference]: Start difference. First operand 161 states and 248 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:30,616 INFO L93 Difference]: Finished difference Result 335 states and 514 transitions. [2025-03-03 19:40:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:40:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2025-03-03 19:40:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:30,620 INFO L225 Difference]: With dead ends: 335 [2025-03-03 19:40:30,621 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 19:40:30,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:40:30,623 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 93 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:30,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 423 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:40:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 19:40:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2025-03-03 19:40:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:40:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-03-03 19:40:30,661 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 210 [2025-03-03 19:40:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:30,661 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-03-03 19:40:30,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-03-03 19:40:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:40:30,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:30,663 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:40:30,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 333019206, now seen corresponding path program 1 times [2025-03-03 19:40:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253474153] [2025-03-03 19:40:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:30,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:40:30,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:40:30,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:30,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253474153] [2025-03-03 19:40:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253474153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:30,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:30,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:40:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562882569] [2025-03-03 19:40:30,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:30,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:40:30,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:30,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:40:30,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:30,820 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:30,849 INFO L93 Difference]: Finished difference Result 329 states and 509 transitions. [2025-03-03 19:40:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:40:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2025-03-03 19:40:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:30,851 INFO L225 Difference]: With dead ends: 329 [2025-03-03 19:40:30,851 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 19:40:30,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:30,852 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:30,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 261 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:30,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 19:40:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2025-03-03 19:40:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:40:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2025-03-03 19:40:30,880 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 211 [2025-03-03 19:40:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:30,880 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2025-03-03 19:40:30,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2025-03-03 19:40:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:40:30,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:30,882 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:30,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:40:30,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:30,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash 462101925, now seen corresponding path program 1 times [2025-03-03 19:40:30,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670906650] [2025-03-03 19:40:30,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:30,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:40:30,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:40:30,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:30,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:31,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:31,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670906650] [2025-03-03 19:40:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670906650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:31,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:40:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420165870] [2025-03-03 19:40:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:31,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:40:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:31,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:40:31,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:40:31,090 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:31,121 INFO L93 Difference]: Finished difference Result 335 states and 505 transitions. [2025-03-03 19:40:31,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:40:31,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2025-03-03 19:40:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:31,125 INFO L225 Difference]: With dead ends: 335 [2025-03-03 19:40:31,126 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 19:40:31,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 19:40:31,128 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 32 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:31,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 19:40:31,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2025-03-03 19:40:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 100 states have internal predecessors, (116), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:40:31,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 260 transitions. [2025-03-03 19:40:31,151 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 260 transitions. Word has length 211 [2025-03-03 19:40:31,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:31,152 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 260 transitions. [2025-03-03 19:40:31,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:31,152 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 260 transitions. [2025-03-03 19:40:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:40:31,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:31,153 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:31,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:40:31,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:31,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash 778609854, now seen corresponding path program 1 times [2025-03-03 19:40:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195029793] [2025-03-03 19:40:31,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:40:31,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:40:31,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:31,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 19:40:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:40:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195029793] [2025-03-03 19:40:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195029793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:40:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171555093] [2025-03-03 19:40:31,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:31,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:31,529 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 19:40:31,530 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 19:40:31,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:40:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:40:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 19:40:31,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1125 proven. 57 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-03 19:40:32,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:40:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 19:40:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171555093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:40:32,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:40:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-03 19:40:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968491319] [2025-03-03 19:40:32,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:40:32,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:40:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:40:32,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:40:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:40:32,685 INFO L87 Difference]: Start difference. First operand 176 states and 260 transitions. Second operand has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) [2025-03-03 19:40:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:33,148 INFO L93 Difference]: Finished difference Result 280 states and 403 transitions. [2025-03-03 19:40:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 19:40:33,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) Word has length 212 [2025-03-03 19:40:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:33,152 INFO L225 Difference]: With dead ends: 280 [2025-03-03 19:40:33,152 INFO L226 Difference]: Without dead ends: 196 [2025-03-03 19:40:33,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 414 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-03 19:40:33,154 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 250 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:33,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 298 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:40:33,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-03 19:40:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 184. [2025-03-03 19:40:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 106 states have internal predecessors, (119), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:40:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 263 transitions. [2025-03-03 19:40:33,181 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 263 transitions. Word has length 212 [2025-03-03 19:40:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:33,182 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 263 transitions. [2025-03-03 19:40:33,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) [2025-03-03 19:40:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 263 transitions. [2025-03-03 19:40:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:40:33,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:33,184 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:33,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:40:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 19:40:33,388 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1239438432, now seen corresponding path program 1 times [2025-03-03 19:40:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:40:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739871372] [2025-03-03 19:40:33,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:40:33,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:40:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:40:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:40:33,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035878303] [2025-03-03 19:40:33,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:33,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:33,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:33,487 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 19:40:33,488 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 19:40:33,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:40:33,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:40:33,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:33,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:40:33,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:40:33,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:40:33,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:40:33,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:33,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:40:33,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:40:33,752 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:40:33,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:40:33,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:33,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:40:33,960 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:40:34,078 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:40:34,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:40:34 BoogieIcfgContainer [2025-03-03 19:40:34,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:40:34,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:40:34,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:40:34,081 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:40:34,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:28" (3/4) ... [2025-03-03 19:40:34,084 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:40:34,085 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:40:34,086 INFO L158 Benchmark]: Toolchain (without parser) took 6396.94ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.4MB in the beginning and 70.6MB in the end (delta: 51.7MB). Peak memory consumption was 87.1MB. Max. memory is 16.1GB. [2025-03-03 19:40:34,086 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:34,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:40:34,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.78ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:34,087 INFO L158 Benchmark]: Boogie Preprocessor took 64.64ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 95.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:40:34,087 INFO L158 Benchmark]: IcfgBuilder took 487.53ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 69.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:40:34,088 INFO L158 Benchmark]: TraceAbstraction took 5514.87ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 69.5MB in the beginning and 70.7MB in the end (delta: -1.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2025-03-03 19:40:34,088 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 201.3MB. Free memory was 70.7MB in the beginning and 70.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:40:34,089 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.24ms. Allocated memory is still 201.3MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.78ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 102.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.64ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 95.2MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 487.53ms. Allocated memory is still 167.8MB. Free memory was 95.2MB in the beginning and 69.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5514.87ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 69.5MB in the beginning and 70.7MB in the end (delta: -1.2MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 201.3MB. Free memory was 70.7MB in the beginning and 70.6MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] signed short int var_1_29 = 16; [L48] signed short int var_1_30 = 64; [L49] signed long int var_1_31 = -64; [L50] double var_1_32 = 255.5; [L51] double var_1_33 = 100.3; [L52] signed short int var_1_34 = 100; [L53] float var_1_35 = 4.6; [L54] signed char var_1_36 = 4; [L55] signed char var_1_37 = 1; [L56] signed short int var_1_38 = 64; [L57] signed char var_1_39 = -64; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; VAL [isInitial=0, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L176] last_1_var_1_18 = var_1_18 [L177] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L119] var_1_2 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] var_1_3 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] var_1_8 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L127] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] var_1_10 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_11 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] var_1_13 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] var_1_14 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L136] var_1_15 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L137] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] var_1_16 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L139] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L140] var_1_17 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] var_1_21 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L147] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L150] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L150] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L154] var_1_24 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L155] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L156] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L156] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L159] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L159] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L160] var_1_29 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_29 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L161] RET assume_abort_if_not(var_1_29 >= -1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L162] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L162] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L163] var_1_30 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L166] var_1_31 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L169] var_1_33 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L170] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L171] var_1_37 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L172] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L173] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L188] RET updateVariables() [L189] CALL step() [L63] COND TRUE (var_1_29 - var_1_30) <= var_1_31 [L64] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L66] var_1_32 = var_1_33 [L67] var_1_34 = 10 [L68] var_1_35 = var_1_33 [L69] var_1_36 = var_1_37 [L70] var_1_38 = var_1_37 [L71] var_1_39 = 8 [L72] signed long int stepLocal_1 = last_1_var_1_20; [L73] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L74] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L75] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L78] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L88] var_1_26 = var_1_16 [L89] var_1_27 = 10u [L90] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L91] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L92] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L96] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L97] COND TRUE var_1_15 >= var_1_26 [L98] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L105] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L106] COND FALSE !(! var_1_18) [L109] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L114] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L115] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; VAL [\result=0, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=0, var_1_29=-1, var_1_2=1, var_1_30=0, var_1_31=-1, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 1590 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 744 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 637 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2107 NumberOfCodeBlocks, 2107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1886 ConstructedInterpolants, 0 QuantifiedInterpolants, 3891 SizeOfPredicates, 4 NumberOfNonLiveVariables, 993 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 19959/20196 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 19:40:34,111 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_fillercodesize_ps-cn-10_file-79.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 c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:40:35,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:40:36,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:40:36,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:40:36,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:40:36,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:40:36,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:40:36,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:40:36,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:40:36,023 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:40:36,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:40:36,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:40:36,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:40:36,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:40:36,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:40:36,025 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:40:36,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:36,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:40:36,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:40:36,026 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 -> c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 [2025-03-03 19:40:36,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:40:36,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:40:36,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:40:36,265 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:40:36,265 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:40:36,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:37,422 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebb1eaad/1c45a6decb4f46d99c8a8502cf4c34ee/FLAG59d637928 [2025-03-03 19:40:37,618 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:40:37,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:37,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebb1eaad/1c45a6decb4f46d99c8a8502cf4c34ee/FLAG59d637928 [2025-03-03 19:40:37,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ebb1eaad/1c45a6decb4f46d99c8a8502cf4c34ee [2025-03-03 19:40:37,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:40:37,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:40:37,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:37,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:40:38,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:40:38,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:37" (1/1) ... [2025-03-03 19:40:38,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753edd2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38, skipping insertion in model container [2025-03-03 19:40:38,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:40:37" (1/1) ... [2025-03-03 19:40:38,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:40:38,122 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_fillercodesize_ps-cn-10_file-79.i[915,928] [2025-03-03 19:40:38,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:38,185 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:40:38,193 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_fillercodesize_ps-cn-10_file-79.i[915,928] [2025-03-03 19:40:38,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:40:38,228 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:40:38,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38 WrapperNode [2025-03-03 19:40:38,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:40:38,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:38,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:40:38,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:40:38,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,260 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2025-03-03 19:40:38,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:40:38,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:40:38,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:40:38,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:40:38,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,289 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 19:40:38,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:40:38,305 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:40:38,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:40:38,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:40:38,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (1/1) ... [2025-03-03 19:40:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:40:38,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:40:38,342 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 19:40:38,346 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 19:40:38,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:40:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:40:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:40:38,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:40:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:40:38,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:40:38,438 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:40:38,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:40:48,962 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:40:48,964 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:40:48,971 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:40:48,971 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:40:48,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:48 BoogieIcfgContainer [2025-03-03 19:40:48,972 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:40:48,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:40:48,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:40:48,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:40:48,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:40:37" (1/3) ... [2025-03-03 19:40:48,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bbdb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:48, skipping insertion in model container [2025-03-03 19:40:48,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:40:38" (2/3) ... [2025-03-03 19:40:48,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115bbdb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:40:48, skipping insertion in model container [2025-03-03 19:40:48,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:40:48" (3/3) ... [2025-03-03 19:40:48,979 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-03 19:40:48,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:40:48,991 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:40:49,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:40:49,035 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;@3dba921e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:40:49,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:40:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 50 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 19:40:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:40:49,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:49,050 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:49,050 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:49,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 885902974, now seen corresponding path program 1 times [2025-03-03 19:40:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:49,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151110070] [2025-03-03 19:40:49,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:49,062 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 19:40:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:49,064 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 19:40:49,066 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 19:40:49,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:40:49,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:40:49,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:49,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:49,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:40:49,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1034 proven. 0 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-03 19:40:49,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:49,598 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:49,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151110070] [2025-03-03 19:40:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151110070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:49,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:49,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:40:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382090505] [2025-03-03 19:40:49,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:49,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:40:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:49,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:40:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:40:49,622 INFO L87 Difference]: Start difference. First operand has 86 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 50 states have internal predecessors, (64), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 19:40:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:49,647 INFO L93 Difference]: Finished difference Result 166 states and 293 transitions. [2025-03-03 19:40:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:40:49,649 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 209 [2025-03-03 19:40:49,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:49,653 INFO L225 Difference]: With dead ends: 166 [2025-03-03 19:40:49,653 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 19:40:49,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 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 19:40:49,658 INFO L435 NwaCegarLoop]: 127 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, 127 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 19:40:49,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:40:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 19:40:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-03 19:40:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 19:40:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 127 transitions. [2025-03-03 19:40:49,687 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 127 transitions. Word has length 209 [2025-03-03 19:40:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:49,687 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 127 transitions. [2025-03-03 19:40:49,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 19:40:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 127 transitions. [2025-03-03 19:40:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 19:40:49,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:49,692 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:49,707 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 19:40:49,893 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 19:40:49,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 853942084, now seen corresponding path program 1 times [2025-03-03 19:40:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623689718] [2025-03-03 19:40:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:49,897 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 19:40:49,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:49,899 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 19:40:49,900 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 19:40:49,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 19:40:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 19:40:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:50,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:40:50,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:51,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:51,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623689718] [2025-03-03 19:40:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623689718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:40:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889060484] [2025-03-03 19:40:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:40:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:51,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:40:51,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:40:51,736 INFO L87 Difference]: Start difference. First operand 83 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:55,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:40:56,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:40:56,110 INFO L93 Difference]: Finished difference Result 257 states and 395 transitions. [2025-03-03 19:40:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:40:56,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 209 [2025-03-03 19:40:56,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:40:56,112 INFO L225 Difference]: With dead ends: 257 [2025-03-03 19:40:56,113 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 19:40:56,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:40:56,114 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 90 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:40:56,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 423 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 19:40:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 19:40:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2025-03-03 19:40:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:40:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 247 transitions. [2025-03-03 19:40:56,155 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 247 transitions. Word has length 209 [2025-03-03 19:40:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:40:56,156 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 247 transitions. [2025-03-03 19:40:56,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 247 transitions. [2025-03-03 19:40:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:40:56,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:40:56,158 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:40:56,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:40:56,358 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 19:40:56,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:40:56,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:40:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 333019206, now seen corresponding path program 1 times [2025-03-03 19:40:56,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:40:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151747495] [2025-03-03 19:40:56,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:40:56,361 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 19:40:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:40:56,363 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 19:40:56,363 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 19:40:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:40:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:40:56,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:40:56,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:40:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:40:56,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:40:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:40:57,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:40:57,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:40:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151747495] [2025-03-03 19:40:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151747495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:40:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:40:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:40:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329822958] [2025-03-03 19:40:57,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:40:57,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:40:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:40:57,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:40:57,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:40:57,823 INFO L87 Difference]: Start difference. First operand 161 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:40:59,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:03,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:06,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:06,422 INFO L93 Difference]: Finished difference Result 412 states and 632 transitions. [2025-03-03 19:41:06,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:41:06,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2025-03-03 19:41:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:06,452 INFO L225 Difference]: With dead ends: 412 [2025-03-03 19:41:06,452 INFO L226 Difference]: Without dead ends: 254 [2025-03-03 19:41:06,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:41:06,454 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 66 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:06,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 412 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 90 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2025-03-03 19:41:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-03 19:41:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2025-03-03 19:41:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 120 states have internal predecessors, (142), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 19:41:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 346 transitions. [2025-03-03 19:41:06,485 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 346 transitions. Word has length 211 [2025-03-03 19:41:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:06,486 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 346 transitions. [2025-03-03 19:41:06,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:41:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 346 transitions. [2025-03-03 19:41:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 19:41:06,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:06,491 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:06,508 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 (4)] Ended with exit code 0 [2025-03-03 19:41:06,691 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 19:41:06,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 462101925, now seen corresponding path program 1 times [2025-03-03 19:41:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:41:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981707640] [2025-03-03 19:41:06,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:06,694 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 19:41:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:41:06,696 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 19:41:06,698 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 19:41:06,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 19:41:07,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 19:41:07,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:07,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:07,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:41:07,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:41:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 19:41:07,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:41:07,143 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:41:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981707640] [2025-03-03 19:41:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981707640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:41:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:41:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:41:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392525119] [2025-03-03 19:41:07,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:41:07,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:41:07,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:41:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:41:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:41:07,145 INFO L87 Difference]: Start difference. First operand 226 states and 346 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:41:11,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:11,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:11,302 INFO L93 Difference]: Finished difference Result 392 states and 596 transitions. [2025-03-03 19:41:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:41:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2025-03-03 19:41:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:11,305 INFO L225 Difference]: With dead ends: 392 [2025-03-03 19:41:11,305 INFO L226 Difference]: Without dead ends: 234 [2025-03-03 19:41:11,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 209 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 19:41:11,306 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 32 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:11,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 19:41:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-03 19:41:11,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-03 19:41:11,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 126 states have (on average 1.1587301587301588) internal successors, (146), 126 states have internal predecessors, (146), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 19:41:11,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 350 transitions. [2025-03-03 19:41:11,323 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 350 transitions. Word has length 211 [2025-03-03 19:41:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 350 transitions. [2025-03-03 19:41:11,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 19:41:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 350 transitions. [2025-03-03 19:41:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:41:11,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:11,325 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:11,340 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 (5)] Ended with exit code 0 [2025-03-03 19:41:11,526 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 19:41:11,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:11,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 778609854, now seen corresponding path program 1 times [2025-03-03 19:41:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:41:11,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199440317] [2025-03-03 19:41:11,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:11,527 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 19:41:11,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:41:11,529 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 19:41:11,531 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 19:41:11,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:41:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:41:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:11,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:41:11,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:41:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1125 proven. 57 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-03 19:41:12,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:41:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 19:41:13,195 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:41:13,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199440317] [2025-03-03 19:41:13,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199440317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:41:13,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:41:13,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-03 19:41:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121727439] [2025-03-03 19:41:13,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:41:13,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:41:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:41:13,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:41:13,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:41:13,197 INFO L87 Difference]: Start difference. First operand 234 states and 350 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-03 19:41:16,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:41:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:41:16,768 INFO L93 Difference]: Finished difference Result 346 states and 501 transitions. [2025-03-03 19:41:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 19:41:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 212 [2025-03-03 19:41:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:41:16,798 INFO L225 Difference]: With dead ends: 346 [2025-03-03 19:41:16,799 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 19:41:16,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-03 19:41:16,799 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 223 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:41:16,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 180 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 19:41:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 19:41:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 246. [2025-03-03 19:41:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 135 states have (on average 1.1333333333333333) internal successors, (153), 135 states have internal predecessors, (153), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 19:41:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 357 transitions. [2025-03-03 19:41:16,817 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 357 transitions. Word has length 212 [2025-03-03 19:41:16,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:41:16,817 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 357 transitions. [2025-03-03 19:41:16,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-03 19:41:16,817 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 357 transitions. [2025-03-03 19:41:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 19:41:16,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:41:16,819 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:41:16,833 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 (6)] Ended with exit code 0 [2025-03-03 19:41:17,019 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 19:41:17,019 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:41:17,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:41:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1239438432, now seen corresponding path program 1 times [2025-03-03 19:41:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:41:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578533774] [2025-03-03 19:41:17,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:41:17,020 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 19:41:17,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:41:17,022 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 19:41:17,024 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 19:41:17,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 19:41:17,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 19:41:17,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:41:17,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:41:17,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 19:41:17,415 INFO L279 TraceCheckSpWp]: Computing forward predicates...