./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:37:31,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:37:32,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:37:32,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:37:32,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:37:32,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:37:32,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:37:32,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:37:32,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:37:32,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:37:32,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:37:32,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:37:32,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:37:32,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:37:32,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:37:32,052 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:37:32,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:32,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:37:32,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:37:32,053 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2025-03-08 12:37:32,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:37:32,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:37:32,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:37:32,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:37:32,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:37:32,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:37:33,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d7ca726/29d1317418d84e6bb99c7259bcaf8c01/FLAGdbf29229c [2025-03-08 12:37:33,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:37:33,659 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:37:33,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d7ca726/29d1317418d84e6bb99c7259bcaf8c01/FLAGdbf29229c [2025-03-08 12:37:33,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0d7ca726/29d1317418d84e6bb99c7259bcaf8c01 [2025-03-08 12:37:33,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:37:33,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:37:33,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:33,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:37:33,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:37:33,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:33,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e53aa74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33, skipping insertion in model container [2025-03-08 12:37:33,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:33,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:37:33,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2025-03-08 12:37:33,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:33,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:37:33,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2025-03-08 12:37:33,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:33,949 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:37:33,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33 WrapperNode [2025-03-08 12:37:33,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:33,951 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:33,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:37:33,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:37:33,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:33,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:33,987 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-03-08 12:37:33,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:33,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:37:33,990 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:37:33,990 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:37:33,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:33,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,023 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:37:34,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:37:34,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:37:34,038 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:37:34,038 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:37:34,039 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (1/1) ... [2025-03-08 12:37:34,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:34,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:34,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:37:34,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:37:34,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:37:34,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:37:34,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:37:34,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:37:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:37:34,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:37:34,156 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:37:34,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:37:34,572 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-08 12:37:34,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:37:34,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:37:34,592 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 12:37:34,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:34 BoogieIcfgContainer [2025-03-08 12:37:34,592 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:37:34,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:37:34,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:37:34,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:37:34,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:37:33" (1/3) ... [2025-03-08 12:37:34,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258318df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:34, skipping insertion in model container [2025-03-08 12:37:34,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:33" (2/3) ... [2025-03-08 12:37:34,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258318df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:37:34, skipping insertion in model container [2025-03-08 12:37:34,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:34" (3/3) ... [2025-03-08 12:37:34,602 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:37:34,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:37:34,615 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i that has 2 procedures, 108 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:37:34,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:37:34,663 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;@5bca6afe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:37:34,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:37:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 76 states have (on average 1.513157894736842) internal successors, (115), 77 states have internal predecessors, (115), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 12:37:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:37:34,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:34,681 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:34,681 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:34,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:34,685 INFO L85 PathProgramCache]: Analyzing trace with hash -832180893, now seen corresponding path program 1 times [2025-03-08 12:37:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234597206] [2025-03-08 12:37:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:34,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:34,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:37:34,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:37:34,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:34,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 12:37:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234597206] [2025-03-08 12:37:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234597206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:37:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006840358] [2025-03-08 12:37:34,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:34,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:34,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:34,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:37:34,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 12:37:35,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:37:35,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:37:35,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:35,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:37:35,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 12:37:35,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:37:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006840358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:35,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:37:35,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:37:35,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042819554] [2025-03-08 12:37:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:35,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:37:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:35,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:37:35,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:37:35,199 INFO L87 Difference]: Start difference. First operand has 108 states, 76 states have (on average 1.513157894736842) internal successors, (115), 77 states have internal predecessors, (115), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:37:35,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:35,242 INFO L93 Difference]: Finished difference Result 210 states and 370 transitions. [2025-03-08 12:37:35,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:37:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2025-03-08 12:37:35,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:35,249 INFO L225 Difference]: With dead ends: 210 [2025-03-08 12:37:35,250 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 12:37:35,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:37:35,255 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:35,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:35,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 12:37:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-08 12:37:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 74 states have internal predecessors, (110), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 12:37:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 168 transitions. [2025-03-08 12:37:35,284 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 168 transitions. Word has length 190 [2025-03-08 12:37:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:35,284 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 168 transitions. [2025-03-08 12:37:35,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:37:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 168 transitions. [2025-03-08 12:37:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-08 12:37:35,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:35,287 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:35,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 12:37:35,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 12:37:35,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:35,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:35,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1765125634, now seen corresponding path program 1 times [2025-03-08 12:37:35,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:35,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773576790] [2025-03-08 12:37:35,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:35,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 12:37:35,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 12:37:35,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:35,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:35,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773576790] [2025-03-08 12:37:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773576790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:35,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:35,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:37:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607381309] [2025-03-08 12:37:35,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:37:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:35,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:37:35,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:37:35,875 INFO L87 Difference]: Start difference. First operand 105 states and 168 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:35,982 INFO L93 Difference]: Finished difference Result 302 states and 488 transitions. [2025-03-08 12:37:35,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:37:35,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-03-08 12:37:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:35,988 INFO L225 Difference]: With dead ends: 302 [2025-03-08 12:37:35,988 INFO L226 Difference]: Without dead ends: 200 [2025-03-08 12:37:35,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:35,990 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 98 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:35,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 505 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:37:35,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-08 12:37:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-03-08 12:37:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 137 states have (on average 1.467153284671533) internal successors, (201), 137 states have internal predecessors, (201), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 12:37:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 317 transitions. [2025-03-08 12:37:36,022 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 317 transitions. Word has length 190 [2025-03-08 12:37:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:36,025 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 317 transitions. [2025-03-08 12:37:36,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 317 transitions. [2025-03-08 12:37:36,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 12:37:36,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:36,027 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:37:36,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:36,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1027962019, now seen corresponding path program 1 times [2025-03-08 12:37:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911039124] [2025-03-08 12:37:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:36,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 12:37:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 12:37:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:36,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:36,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:36,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911039124] [2025-03-08 12:37:36,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911039124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:36,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:36,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:36,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042659448] [2025-03-08 12:37:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:36,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:36,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:36,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:36,336 INFO L87 Difference]: Start difference. First operand 198 states and 317 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:36,705 INFO L93 Difference]: Finished difference Result 683 states and 1095 transitions. [2025-03-08 12:37:36,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:37:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-03-08 12:37:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:36,711 INFO L225 Difference]: With dead ends: 683 [2025-03-08 12:37:36,713 INFO L226 Difference]: Without dead ends: 488 [2025-03-08 12:37:36,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:37:36,716 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 283 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:36,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 452 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:37:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-08 12:37:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 432. [2025-03-08 12:37:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 281 states have (on average 1.3843416370106763) internal successors, (389), 281 states have internal predecessors, (389), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-08 12:37:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 679 transitions. [2025-03-08 12:37:36,793 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 679 transitions. Word has length 192 [2025-03-08 12:37:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:36,794 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 679 transitions. [2025-03-08 12:37:36,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 679 transitions. [2025-03-08 12:37:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-08 12:37:36,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:36,796 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:36,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:37:36,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:36,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash -431826671, now seen corresponding path program 1 times [2025-03-08 12:37:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151199923] [2025-03-08 12:37:36,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-08 12:37:36,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-08 12:37:36,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:36,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:36,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:36,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151199923] [2025-03-08 12:37:36,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151199923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:36,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140212895] [2025-03-08 12:37:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:36,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:36,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:36,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:36,979 INFO L87 Difference]: Start difference. First operand 432 states and 679 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:37,217 INFO L93 Difference]: Finished difference Result 863 states and 1356 transitions. [2025-03-08 12:37:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:37:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-03-08 12:37:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:37,223 INFO L225 Difference]: With dead ends: 863 [2025-03-08 12:37:37,223 INFO L226 Difference]: Without dead ends: 434 [2025-03-08 12:37:37,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:37:37,226 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 89 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:37,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 495 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:37:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-08 12:37:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2025-03-08 12:37:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 280 states have (on average 1.3785714285714286) internal successors, (386), 280 states have internal predecessors, (386), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-08 12:37:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 676 transitions. [2025-03-08 12:37:37,274 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 676 transitions. Word has length 192 [2025-03-08 12:37:37,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:37,274 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 676 transitions. [2025-03-08 12:37:37,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 676 transitions. [2025-03-08 12:37:37,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 12:37:37,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:37,276 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:37,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:37:37,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:37,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1411326580, now seen corresponding path program 1 times [2025-03-08 12:37:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642847343] [2025-03-08 12:37:37,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:37,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:37,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 12:37:37,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 12:37:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:37,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:37,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642847343] [2025-03-08 12:37:37,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642847343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:37,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:37,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582564640] [2025-03-08 12:37:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:37,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:37,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:37,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:37,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:37,387 INFO L87 Difference]: Start difference. First operand 431 states and 676 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:37,459 INFO L93 Difference]: Finished difference Result 1133 states and 1774 transitions. [2025-03-08 12:37:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 195 [2025-03-08 12:37:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:37,464 INFO L225 Difference]: With dead ends: 1133 [2025-03-08 12:37:37,464 INFO L226 Difference]: Without dead ends: 705 [2025-03-08 12:37:37,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:37,467 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 94 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:37,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 368 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:37,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-03-08 12:37:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 698. [2025-03-08 12:37:37,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 447 states have (on average 1.3691275167785235) internal successors, (612), 452 states have internal predecessors, (612), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 12:37:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1092 transitions. [2025-03-08 12:37:37,523 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1092 transitions. Word has length 195 [2025-03-08 12:37:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:37,525 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1092 transitions. [2025-03-08 12:37:37,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1092 transitions. [2025-03-08 12:37:37,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:37:37,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:37,526 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:37,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:37:37,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:37,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:37,527 INFO L85 PathProgramCache]: Analyzing trace with hash 902171018, now seen corresponding path program 1 times [2025-03-08 12:37:37,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:37,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849404262] [2025-03-08 12:37:37,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:37,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:37,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:37:37,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:37:37,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:37,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:37,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849404262] [2025-03-08 12:37:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849404262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:37,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:37,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:37,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077261655] [2025-03-08 12:37:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:37,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:37,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:37,712 INFO L87 Difference]: Start difference. First operand 698 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:37,777 INFO L93 Difference]: Finished difference Result 1393 states and 2181 transitions. [2025-03-08 12:37:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2025-03-08 12:37:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:37,783 INFO L225 Difference]: With dead ends: 1393 [2025-03-08 12:37:37,783 INFO L226 Difference]: Without dead ends: 698 [2025-03-08 12:37:37,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:37,786 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:37,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 159 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-03-08 12:37:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2025-03-08 12:37:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 447 states have (on average 1.3557046979865772) internal successors, (606), 452 states have internal predecessors, (606), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-08 12:37:37,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1086 transitions. [2025-03-08 12:37:37,873 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1086 transitions. Word has length 196 [2025-03-08 12:37:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:37,873 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1086 transitions. [2025-03-08 12:37:37,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1086 transitions. [2025-03-08 12:37:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-08 12:37:37,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:37,875 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:37,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:37:37,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:37,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:37,876 INFO L85 PathProgramCache]: Analyzing trace with hash 608768011, now seen corresponding path program 1 times [2025-03-08 12:37:37,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:37,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961235550] [2025-03-08 12:37:37,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:37,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:37,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 12:37:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 12:37:37,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:38,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:38,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961235550] [2025-03-08 12:37:38,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961235550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:38,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114310347] [2025-03-08 12:37:38,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:38,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:38,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:38,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:38,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:38,147 INFO L87 Difference]: Start difference. First operand 698 states and 1086 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:38,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:38,268 INFO L93 Difference]: Finished difference Result 1541 states and 2409 transitions. [2025-03-08 12:37:38,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:38,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 196 [2025-03-08 12:37:38,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:38,274 INFO L225 Difference]: With dead ends: 1541 [2025-03-08 12:37:38,274 INFO L226 Difference]: Without dead ends: 846 [2025-03-08 12:37:38,277 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-08 12:37:38,277 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:38,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 290 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-08 12:37:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 798. [2025-03-08 12:37:38,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 517 states have (on average 1.3655705996131529) internal successors, (706), 522 states have internal predecessors, (706), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2025-03-08 12:37:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1244 transitions. [2025-03-08 12:37:38,360 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1244 transitions. Word has length 196 [2025-03-08 12:37:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1244 transitions. [2025-03-08 12:37:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1244 transitions. [2025-03-08 12:37:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-08 12:37:38,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:38,363 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:38,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:37:38,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:38,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2014873676, now seen corresponding path program 1 times [2025-03-08 12:37:38,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:38,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586863604] [2025-03-08 12:37:38,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-08 12:37:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-08 12:37:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:38,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:38,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:38,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586863604] [2025-03-08 12:37:38,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586863604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:38,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:38,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659695007] [2025-03-08 12:37:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:38,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:38,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:38,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:38,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:38,573 INFO L87 Difference]: Start difference. First operand 798 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:38,710 INFO L93 Difference]: Finished difference Result 1541 states and 2405 transitions. [2025-03-08 12:37:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 197 [2025-03-08 12:37:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:38,717 INFO L225 Difference]: With dead ends: 1541 [2025-03-08 12:37:38,717 INFO L226 Difference]: Without dead ends: 846 [2025-03-08 12:37:38,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:38,720 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 72 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:38,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 308 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:37:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-08 12:37:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 802. [2025-03-08 12:37:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 521 states have (on average 1.362763915547025) internal successors, (710), 526 states have internal predecessors, (710), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2025-03-08 12:37:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1248 transitions. [2025-03-08 12:37:38,807 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1248 transitions. Word has length 197 [2025-03-08 12:37:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1248 transitions. [2025-03-08 12:37:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1248 transitions. [2025-03-08 12:37:38,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:38,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:38,809 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:38,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:37:38,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -443088882, now seen corresponding path program 1 times [2025-03-08 12:37:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514266194] [2025-03-08 12:37:38,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:38,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:38,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:38,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514266194] [2025-03-08 12:37:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514266194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:38,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:38,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:38,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228067432] [2025-03-08 12:37:38,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:38,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:38,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:38,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:38,957 INFO L87 Difference]: Start difference. First operand 802 states and 1248 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:39,301 INFO L93 Difference]: Finished difference Result 2740 states and 4173 transitions. [2025-03-08 12:37:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:37:39,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:39,312 INFO L225 Difference]: With dead ends: 2740 [2025-03-08 12:37:39,312 INFO L226 Difference]: Without dead ends: 2196 [2025-03-08 12:37:39,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:37:39,316 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 522 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:39,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 962 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:37:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2025-03-08 12:37:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2152. [2025-03-08 12:37:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2152 states, 1579 states have (on average 1.4129195693476884) internal successors, (2231), 1612 states have internal predecessors, (2231), 517 states have call successors, (517), 55 states have call predecessors, (517), 55 states have return successors, (517), 484 states have call predecessors, (517), 517 states have call successors, (517) [2025-03-08 12:37:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2152 states to 2152 states and 3265 transitions. [2025-03-08 12:37:39,513 INFO L78 Accepts]: Start accepts. Automaton has 2152 states and 3265 transitions. Word has length 198 [2025-03-08 12:37:39,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:39,513 INFO L471 AbstractCegarLoop]: Abstraction has 2152 states and 3265 transitions. [2025-03-08 12:37:39,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:39,513 INFO L276 IsEmpty]: Start isEmpty. Operand 2152 states and 3265 transitions. [2025-03-08 12:37:39,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:39,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:39,517 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:39,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:37:39,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1330592563, now seen corresponding path program 1 times [2025-03-08 12:37:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:39,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557983390] [2025-03-08 12:37:39,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:39,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:39,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:39,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:39,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:39,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:39,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:39,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557983390] [2025-03-08 12:37:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557983390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:39,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:39,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554220584] [2025-03-08 12:37:39,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:39,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:39,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:39,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:39,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:39,737 INFO L87 Difference]: Start difference. First operand 2152 states and 3265 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:40,071 INFO L93 Difference]: Finished difference Result 4354 states and 6527 transitions. [2025-03-08 12:37:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:37:40,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:40,087 INFO L225 Difference]: With dead ends: 4354 [2025-03-08 12:37:40,087 INFO L226 Difference]: Without dead ends: 2600 [2025-03-08 12:37:40,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:37:40,093 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 252 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:40,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 589 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:37:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2025-03-08 12:37:40,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2580. [2025-03-08 12:37:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 1952 states have (on average 1.4113729508196722) internal successors, (2755), 1999 states have internal predecessors, (2755), 545 states have call successors, (545), 82 states have call predecessors, (545), 82 states have return successors, (545), 498 states have call predecessors, (545), 545 states have call successors, (545) [2025-03-08 12:37:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 3845 transitions. [2025-03-08 12:37:40,301 INFO L78 Accepts]: Start accepts. Automaton has 2580 states and 3845 transitions. Word has length 198 [2025-03-08 12:37:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:40,302 INFO L471 AbstractCegarLoop]: Abstraction has 2580 states and 3845 transitions. [2025-03-08 12:37:40,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2580 states and 3845 transitions. [2025-03-08 12:37:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:40,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:40,304 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:40,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:37:40,305 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1301963412, now seen corresponding path program 1 times [2025-03-08 12:37:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:40,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412237107] [2025-03-08 12:37:40,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:40,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:40,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:40,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:40,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:40,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:40,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412237107] [2025-03-08 12:37:40,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412237107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:40,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:40,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:37:40,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714765572] [2025-03-08 12:37:40,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:40,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:37:40,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:40,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:37:40,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:40,547 INFO L87 Difference]: Start difference. First operand 2580 states and 3845 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:41,085 INFO L93 Difference]: Finished difference Result 5542 states and 8351 transitions. [2025-03-08 12:37:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:37:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:41,102 INFO L225 Difference]: With dead ends: 5542 [2025-03-08 12:37:41,103 INFO L226 Difference]: Without dead ends: 3110 [2025-03-08 12:37:41,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:41,110 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 210 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:41,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 601 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:37:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-03-08 12:37:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 2848. [2025-03-08 12:37:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2246 states have (on average 1.460373998219056) internal successors, (3280), 2290 states have internal predecessors, (3280), 520 states have call successors, (520), 81 states have call predecessors, (520), 81 states have return successors, (520), 476 states have call predecessors, (520), 520 states have call successors, (520) [2025-03-08 12:37:41,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4320 transitions. [2025-03-08 12:37:41,327 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4320 transitions. Word has length 198 [2025-03-08 12:37:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:41,328 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4320 transitions. [2025-03-08 12:37:41,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4320 transitions. [2025-03-08 12:37:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:41,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:41,332 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:41,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:37:41,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:41,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash -399983447, now seen corresponding path program 1 times [2025-03-08 12:37:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47052563] [2025-03-08 12:37:41,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:41,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:41,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:41,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:41,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47052563] [2025-03-08 12:37:41,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47052563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:41,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:37:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696120059] [2025-03-08 12:37:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:37:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:41,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:37:41,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:37:41,582 INFO L87 Difference]: Start difference. First operand 2848 states and 4320 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:41,861 INFO L93 Difference]: Finished difference Result 5550 states and 8440 transitions. [2025-03-08 12:37:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:37:41,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:41,876 INFO L225 Difference]: With dead ends: 5550 [2025-03-08 12:37:41,876 INFO L226 Difference]: Without dead ends: 2852 [2025-03-08 12:37:41,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:37:41,883 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 93 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:41,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 762 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:37:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-08 12:37:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2850. [2025-03-08 12:37:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2248 states have (on average 1.451067615658363) internal successors, (3262), 2292 states have internal predecessors, (3262), 520 states have call successors, (520), 81 states have call predecessors, (520), 81 states have return successors, (520), 476 states have call predecessors, (520), 520 states have call successors, (520) [2025-03-08 12:37:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4302 transitions. [2025-03-08 12:37:42,031 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4302 transitions. Word has length 198 [2025-03-08 12:37:42,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:42,032 INFO L471 AbstractCegarLoop]: Abstraction has 2850 states and 4302 transitions. [2025-03-08 12:37:42,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4302 transitions. [2025-03-08 12:37:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:42,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:42,034 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:42,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:37:42,034 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:42,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash -808807672, now seen corresponding path program 1 times [2025-03-08 12:37:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659893183] [2025-03-08 12:37:42,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:42,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:42,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:42,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:42,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659893183] [2025-03-08 12:37:42,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659893183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:42,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:42,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:37:42,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664085669] [2025-03-08 12:37:42,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:42,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:37:42,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:42,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:37:42,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:37:42,344 INFO L87 Difference]: Start difference. First operand 2850 states and 4302 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:42,702 INFO L93 Difference]: Finished difference Result 5591 states and 8486 transitions. [2025-03-08 12:37:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:37:42,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:42,719 INFO L225 Difference]: With dead ends: 5591 [2025-03-08 12:37:42,719 INFO L226 Difference]: Without dead ends: 3150 [2025-03-08 12:37:42,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:37:42,727 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 253 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:42,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 612 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:37:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2025-03-08 12:37:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2876. [2025-03-08 12:37:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2274 states have (on average 1.4538258575197889) internal successors, (3306), 2318 states have internal predecessors, (3306), 520 states have call successors, (520), 81 states have call predecessors, (520), 81 states have return successors, (520), 476 states have call predecessors, (520), 520 states have call successors, (520) [2025-03-08 12:37:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4346 transitions. [2025-03-08 12:37:42,887 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4346 transitions. Word has length 198 [2025-03-08 12:37:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:42,887 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4346 transitions. [2025-03-08 12:37:42,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4346 transitions. [2025-03-08 12:37:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:42,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:42,889 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:42,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:37:42,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1403376555, now seen corresponding path program 1 times [2025-03-08 12:37:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15065110] [2025-03-08 12:37:42,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:42,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:42,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:42,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:42,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15065110] [2025-03-08 12:37:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15065110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:42,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:42,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:37:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28692586] [2025-03-08 12:37:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:42,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:37:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:42,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:37:42,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:37:42,979 INFO L87 Difference]: Start difference. First operand 2876 states and 4346 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:43,132 INFO L93 Difference]: Finished difference Result 4876 states and 7405 transitions. [2025-03-08 12:37:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:37:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:43,145 INFO L225 Difference]: With dead ends: 4876 [2025-03-08 12:37:43,146 INFO L226 Difference]: Without dead ends: 2435 [2025-03-08 12:37:43,151 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-08 12:37:43,152 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 152 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:43,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 413 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:37:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2025-03-08 12:37:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 1693. [2025-03-08 12:37:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1377 states have (on average 1.4793028322440087) internal successors, (2037), 1398 states have internal predecessors, (2037), 276 states have call successors, (276), 39 states have call predecessors, (276), 39 states have return successors, (276), 255 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 12:37:43,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2589 transitions. [2025-03-08 12:37:43,287 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2589 transitions. Word has length 198 [2025-03-08 12:37:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:43,287 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2589 transitions. [2025-03-08 12:37:43,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:43,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2589 transitions. [2025-03-08 12:37:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:43,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:43,294 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:43,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 12:37:43,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 515872874, now seen corresponding path program 1 times [2025-03-08 12:37:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:43,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682534902] [2025-03-08 12:37:43,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:43,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:43,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:43,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:43,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:43,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:37:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682534902] [2025-03-08 12:37:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682534902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:37:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:37:43,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:37:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484586378] [2025-03-08 12:37:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:37:43,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:37:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:43,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:37:43,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:37:43,435 INFO L87 Difference]: Start difference. First operand 1693 states and 2589 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:43,599 INFO L93 Difference]: Finished difference Result 2634 states and 3991 transitions. [2025-03-08 12:37:43,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:37:43,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2025-03-08 12:37:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:43,612 INFO L225 Difference]: With dead ends: 2634 [2025-03-08 12:37:43,612 INFO L226 Difference]: Without dead ends: 1760 [2025-03-08 12:37:43,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:37:43,616 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 139 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:43,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 432 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:37:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2025-03-08 12:37:43,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1627. [2025-03-08 12:37:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1311 states have (on average 1.4668192219679634) internal successors, (1923), 1332 states have internal predecessors, (1923), 276 states have call successors, (276), 39 states have call predecessors, (276), 39 states have return successors, (276), 255 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-08 12:37:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 2475 transitions. [2025-03-08 12:37:43,718 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 2475 transitions. Word has length 198 [2025-03-08 12:37:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:43,720 INFO L471 AbstractCegarLoop]: Abstraction has 1627 states and 2475 transitions. [2025-03-08 12:37:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 12:37:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 2475 transitions. [2025-03-08 12:37:43,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-08 12:37:43,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:43,723 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:43,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 12:37:43,723 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:43,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:43,723 INFO L85 PathProgramCache]: Analyzing trace with hash 544502025, now seen corresponding path program 1 times [2025-03-08 12:37:43,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:43,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266426802] [2025-03-08 12:37:43,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:43,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:43,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:43,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:43,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:43,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 12:37:43,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266426802] [2025-03-08 12:37:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266426802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:37:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637997496] [2025-03-08 12:37:43,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:43,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:43,884 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:37:43,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 12:37:43,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 12:37:44,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 12:37:44,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:44,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:44,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 12:37:44,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 758 proven. 126 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-08 12:37:44,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:37:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 129 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-08 12:37:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637997496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:37:44,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:37:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2025-03-08 12:37:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575183903] [2025-03-08 12:37:44,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:37:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 12:37:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:44,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 12:37:44,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-08 12:37:44,935 INFO L87 Difference]: Start difference. First operand 1627 states and 2475 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (77), 3 states have call predecessors, (77), 7 states have return successors, (79), 5 states have call predecessors, (79), 5 states have call successors, (79) [2025-03-08 12:37:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:45,489 INFO L93 Difference]: Finished difference Result 2420 states and 3647 transitions. [2025-03-08 12:37:45,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 12:37:45,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (77), 3 states have call predecessors, (77), 7 states have return successors, (79), 5 states have call predecessors, (79), 5 states have call successors, (79) Word has length 198 [2025-03-08 12:37:45,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:45,498 INFO L225 Difference]: With dead ends: 2420 [2025-03-08 12:37:45,499 INFO L226 Difference]: Without dead ends: 873 [2025-03-08 12:37:45,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2025-03-08 12:37:45,503 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 388 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:45,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 453 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:37:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-08 12:37:45,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 843. [2025-03-08 12:37:45,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 691 states have (on average 1.4254703328509406) internal successors, (985), 698 states have internal predecessors, (985), 124 states have call successors, (124), 27 states have call predecessors, (124), 27 states have return successors, (124), 117 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-08 12:37:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1233 transitions. [2025-03-08 12:37:45,548 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1233 transitions. Word has length 198 [2025-03-08 12:37:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1233 transitions. [2025-03-08 12:37:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 5 states have call successors, (77), 3 states have call predecessors, (77), 7 states have return successors, (79), 5 states have call predecessors, (79), 5 states have call successors, (79) [2025-03-08 12:37:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1233 transitions. [2025-03-08 12:37:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 12:37:45,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:45,550 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:45,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 12:37:45,755 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,SelfDestructingSolverStorable15 [2025-03-08 12:37:45,755 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1888363706, now seen corresponding path program 1 times [2025-03-08 12:37:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813019341] [2025-03-08 12:37:45,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:45,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:37:45,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:37:45,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:45,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:46,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 81 proven. 219 refuted. 0 times theorem prover too weak. 1324 trivial. 0 not checked. [2025-03-08 12:37:46,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:37:46,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813019341] [2025-03-08 12:37:46,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813019341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:37:46,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057442619] [2025-03-08 12:37:46,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:46,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:46,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:46,785 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 12:37:46,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 12:37:46,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:37:46,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:37:46,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:46,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:37:46,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 12:37:46,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:37:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 1073 proven. 237 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-08 12:37:49,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:37:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 123 proven. 267 refuted. 0 times theorem prover too weak. 1234 trivial. 0 not checked. [2025-03-08 12:37:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057442619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:37:51,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 12:37:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 21] total 49 [2025-03-08 12:37:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748732168] [2025-03-08 12:37:51,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 12:37:51,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 12:37:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:37:51,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 12:37:51,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=1835, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 12:37:51,129 INFO L87 Difference]: Start difference. First operand 843 states and 1233 transitions. Second operand has 49 states, 47 states have (on average 4.127659574468085) internal successors, (194), 47 states have internal predecessors, (194), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2025-03-08 12:37:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:37:53,823 INFO L93 Difference]: Finished difference Result 1554 states and 2167 transitions. [2025-03-08 12:37:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-08 12:37:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 4.127659574468085) internal successors, (194), 47 states have internal predecessors, (194), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) Word has length 199 [2025-03-08 12:37:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:37:53,833 INFO L225 Difference]: With dead ends: 1554 [2025-03-08 12:37:53,833 INFO L226 Difference]: Without dead ends: 843 [2025-03-08 12:37:53,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2164 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2467, Invalid=6463, Unknown=0, NotChecked=0, Total=8930 [2025-03-08 12:37:53,837 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 1053 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:37:53,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 797 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 12:37:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-08 12:37:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 463. [2025-03-08 12:37:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 347 states have (on average 1.30835734870317) internal successors, (454), 347 states have internal predecessors, (454), 87 states have call successors, (87), 28 states have call predecessors, (87), 28 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 12:37:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 628 transitions. [2025-03-08 12:37:53,886 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 628 transitions. Word has length 199 [2025-03-08 12:37:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:37:53,887 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 628 transitions. [2025-03-08 12:37:53,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 4.127659574468085) internal successors, (194), 47 states have internal predecessors, (194), 17 states have call successors, (87), 7 states have call predecessors, (87), 16 states have return successors, (87), 16 states have call predecessors, (87), 17 states have call successors, (87) [2025-03-08 12:37:53,887 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 628 transitions. [2025-03-08 12:37:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 12:37:53,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:37:53,888 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:53,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 12:37:54,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:37:54,089 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:37:54,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:37:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1916992857, now seen corresponding path program 1 times [2025-03-08 12:37:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:37:54,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056705291] [2025-03-08 12:37:54,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:37:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:37:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:37:54,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:37:54,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:54,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:37:54,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:37:54,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 12:37:54,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 12:37:54,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:37:54,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:37:54,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:37:54,259 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:37:54,259 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:37:54,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 12:37:54,263 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:37:54,390 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:37:54,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:37:54 BoogieIcfgContainer [2025-03-08 12:37:54,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:37:54,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:37:54,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:37:54,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:37:54,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:37:34" (3/4) ... [2025-03-08 12:37:54,397 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:37:54,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:37:54,399 INFO L158 Benchmark]: Toolchain (without parser) took 20711.54ms. Allocated memory was 201.3MB in the beginning and 629.1MB in the end (delta: 427.8MB). Free memory was 158.1MB in the beginning and 571.2MB in the end (delta: -413.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2025-03-08 12:37:54,399 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:54,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.24ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 142.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:37:54,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 138.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:54,400 INFO L158 Benchmark]: Boogie Preprocessor took 47.46ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 134.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:37:54,400 INFO L158 Benchmark]: IcfgBuilder took 554.37ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 104.1MB in the end (delta: 29.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 12:37:54,400 INFO L158 Benchmark]: TraceAbstraction took 19799.45ms. Allocated memory was 201.3MB in the beginning and 629.1MB in the end (delta: 427.8MB). Free memory was 103.7MB in the beginning and 571.4MB in the end (delta: -467.7MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. [2025-03-08 12:37:54,401 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 629.1MB. Free memory was 571.4MB in the beginning and 571.2MB in the end (delta: 198.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:37:54,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 201.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.24ms. Allocated memory is still 201.3MB. Free memory was 157.7MB in the beginning and 142.7MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 138.9MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.46ms. Allocated memory is still 201.3MB. Free memory was 138.9MB in the beginning and 134.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 554.37ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 104.1MB in the end (delta: 29.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19799.45ms. Allocated memory was 201.3MB in the beginning and 629.1MB in the end (delta: 427.8MB). Free memory was 103.7MB in the beginning and 571.4MB in the end (delta: -467.7MB). Peak memory consumption was 324.7MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 629.1MB. Free memory was 571.4MB in the beginning and 571.2MB in the end (delta: 198.5kB). 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 183, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 159, overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of bitwiseAnd at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_29 = 32; [L44] unsigned long int var_1_32 = 2219578776; [L45] unsigned char var_1_34 = 0; [L46] unsigned char var_1_35 = 0; [L47] unsigned char var_1_36 = 5; [L48] float var_1_37 = 256.125; [L49] float var_1_38 = 127.25; [L50] unsigned char var_1_41 = 32; [L51] double var_1_42 = 16.125; [L52] double var_1_43 = 256.5; [L53] signed short int var_1_45 = -10; [L54] unsigned char last_1_var_1_1 = 2; [L55] unsigned char last_1_var_1_15 = 1; [L56] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_1 = var_1_1 [L192] last_1_var_1_15 = var_1_15 [L193] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] var_1_5 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L149] var_1_6 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_8=32, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_8=32, var_1_9=201/2] [L154] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=32, var_1_9=201/2] [L154] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=32, var_1_9=201/2] [L155] var_1_8 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_9=201/2] [L156] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_9=201/2] [L157] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L158] var_1_11 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L160] var_1_12 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L161] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L164] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L164] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L165] var_1_17 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L166] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L167] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L168] var_1_19 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L169] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L170] var_1_21 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L172] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L172] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L173] var_1_29 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L175] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L175] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L176] var_1_32 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L177] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L178] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L178] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L179] var_1_35 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L180] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L181] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L181] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L182] var_1_37 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L186] var_1_42 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L187] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L188] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L188] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L204] RET updateVariables() [L205] CALL step() [L60] COND FALSE !(var_1_5 >= var_1_6) [L69] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L71] unsigned char stepLocal_1 = var_1_15; [L72] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L73] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L74] COND TRUE var_1_15 && stepLocal_1 [L75] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L80] COND TRUE var_1_13 < ((((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)))) [L81] COND FALSE !(var_1_13 > var_1_1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L84] EXPR var_1_29 ^ var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L84] EXPR (var_1_29 ^ var_1_20) >> var_1_13 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L84] COND FALSE !(((var_1_29 ^ var_1_20) >> var_1_13) > ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) [L95] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L104] COND FALSE !((var_1_38 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_37) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L107] COND TRUE var_1_11 == var_1_18 [L108] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L110] COND FALSE !(var_1_23 >= -25) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L113] COND TRUE (var_1_37 - var_1_38) >= (var_1_18 * var_1_22) [L114] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L116] COND FALSE !((((((var_1_22) < (var_1_37)) ? (var_1_22) : (var_1_37))) >= (var_1_38 / var_1_42)) || var_1_35) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_13 & var_1_24 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_20 ^ (var_1_13 & var_1_24) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L121] COND TRUE var_1_29 <= (var_1_20 ^ (var_1_13 & var_1_24)) [L122] COND FALSE !(\read(var_1_35)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L130] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=201/2] [L133] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L136] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=2219578781] [L138] var_1_22 = var_1_12 [L139] var_1_23 = var_1_8 [L140] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=2219578781] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=2219578781] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-31, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=41055, var_1_5=31, var_1_6=64, var_1_7=-192, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 202 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 18, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3878 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3871 mSDsluCounter, 8360 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5293 mSDsCounter, 458 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3531 IncrementalHoareTripleChecker+Invalid, 3989 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 458 mSolverCounterUnsat, 3067 mSDtfsCounter, 3531 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1172 GetRequests, 1001 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2368 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2876occurred in iteration=13, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 2047 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 4117 NumberOfCodeBlocks, 4117 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 4293 ConstructedInterpolants, 0 QuantifiedInterpolants, 23360 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 34652/35728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 12:37:54,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:37:56,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:37:56,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:37:56,367 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:37:56,367 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:37:56,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:37:56,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:37:56,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:37:56,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:37:56,390 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:37:56,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:37:56,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:37:56,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:37:56,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:37:56,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:37:56,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:37:56,393 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:37:56,393 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:56,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:37:56,394 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:37:56,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:37:56,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:37:56,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:37:56,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:37:56,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:37:56,395 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2025-03-08 12:37:56,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:37:56,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:37:56,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:37:56,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:37:56,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:37:56,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:37:57,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97c70597/8c456b0e8dbc49c396cd02df5505f698/FLAG1314bd884 [2025-03-08 12:37:58,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:37:58,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:37:58,079 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97c70597/8c456b0e8dbc49c396cd02df5505f698/FLAG1314bd884 [2025-03-08 12:37:58,426 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97c70597/8c456b0e8dbc49c396cd02df5505f698 [2025-03-08 12:37:58,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:37:58,429 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:37:58,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:58,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:37:58,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:37:58,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e31555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58, skipping insertion in model container [2025-03-08 12:37:58,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,449 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:37:58,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2025-03-08 12:37:58,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:58,616 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:37:58,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2025-03-08 12:37:58,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:37:58,666 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:37:58,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58 WrapperNode [2025-03-08 12:37:58,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:37:58,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:58,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:37:58,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:37:58,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,697 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-03-08 12:37:58,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:37:58,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:37:58,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:37:58,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:37:58,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,721 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 12:37:58,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,730 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,733 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:37:58,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:37:58,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:37:58,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:37:58,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (1/1) ... [2025-03-08 12:37:58,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:37:58,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:37:58,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 12:37:58,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 12:37:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:37:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:37:58,790 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:37:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:37:58,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:37:58,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:37:58,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:37:58,860 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:38:28,978 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 12:38:28,979 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:38:28,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:38:28,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:38:28,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:28 BoogieIcfgContainer [2025-03-08 12:38:28,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:38:28,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:38:28,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:38:28,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:38:28,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:37:58" (1/3) ... [2025-03-08 12:38:28,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270791b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:28, skipping insertion in model container [2025-03-08 12:38:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:37:58" (2/3) ... [2025-03-08 12:38:28,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270791b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:38:28, skipping insertion in model container [2025-03-08 12:38:28,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:38:28" (3/3) ... [2025-03-08 12:38:28,995 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2025-03-08 12:38:29,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:38:29,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:38:29,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:38:29,064 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;@2f3e9cc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:38:29,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:38:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 12:38:29,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 12:38:29,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:29,080 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:38:29,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 285583037, now seen corresponding path program 1 times [2025-03-08 12:38:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:29,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224409678] [2025-03-08 12:38:29,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:29,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:38:29,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:29,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:38:29,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 12:38:29,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 12:38:30,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 12:38:30,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:30,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:30,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:38:30,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-03-08 12:38:30,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:30,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224409678] [2025-03-08 12:38:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224409678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:38:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870367819] [2025-03-08 12:38:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:30,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:38:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:30,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:38:30,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:38:30,860 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:38:30,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:30,888 INFO L93 Difference]: Finished difference Result 172 states and 308 transitions. [2025-03-08 12:38:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:38:30,889 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 186 [2025-03-08 12:38:30,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:30,893 INFO L225 Difference]: With dead ends: 172 [2025-03-08 12:38:30,893 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 12:38:30,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:38:30,898 INFO L435 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:30,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:38:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 12:38:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 12:38:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 12:38:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2025-03-08 12:38:30,937 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 186 [2025-03-08 12:38:30,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:30,938 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2025-03-08 12:38:30,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 12:38:30,939 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2025-03-08 12:38:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-08 12:38:30,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:30,941 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:38:30,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 12:38:31,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:38:31,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:31,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1938648872, now seen corresponding path program 1 times [2025-03-08 12:38:31,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:31,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079367561] [2025-03-08 12:38:31,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:38:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:31,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:38:31,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 12:38:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-08 12:38:32,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-08 12:38:32,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:32,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:32,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 12:38:32,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2025-03-08 12:38:36,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 12:38:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 12:38:39,926 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079367561] [2025-03-08 12:38:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079367561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 12:38:39,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 12:38:39,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 12:38:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744753633] [2025-03-08 12:38:39,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 12:38:39,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 12:38:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:39,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 12:38:39,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:38:39,929 INFO L87 Difference]: Start difference. First operand 86 states and 137 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:38:44,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:38:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:38:46,216 INFO L93 Difference]: Finished difference Result 201 states and 316 transitions. [2025-03-08 12:38:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:38:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 186 [2025-03-08 12:38:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:38:46,220 INFO L225 Difference]: With dead ends: 201 [2025-03-08 12:38:46,220 INFO L226 Difference]: Without dead ends: 118 [2025-03-08 12:38:46,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:38:46,221 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 196 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:38:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 280 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-08 12:38:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-08 12:38:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2025-03-08 12:38:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 68 states have internal predecessors, (90), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-08 12:38:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 176 transitions. [2025-03-08 12:38:46,235 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 176 transitions. Word has length 186 [2025-03-08 12:38:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:38:46,236 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 176 transitions. [2025-03-08 12:38:46,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2025-03-08 12:38:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 176 transitions. [2025-03-08 12:38:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-08 12:38:46,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:38:46,238 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 12:38:46,276 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-08 12:38:46,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:38:46,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:38:46,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:38:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1518280950, now seen corresponding path program 1 times [2025-03-08 12:38:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:38:46,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301265109] [2025-03-08 12:38:46,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:38:46,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:38:46,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:38:46,442 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:38:46,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 12:38:46,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 12:38:47,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 12:38:47,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:38:47,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:38:47,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 12:38:47,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:38:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 12:38:59,606 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:38:59,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:38:59,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301265109] [2025-03-08 12:38:59,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301265109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:38:59,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:38:59,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:38:59,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082792869] [2025-03-08 12:38:59,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:38:59,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:38:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:38:59,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:38:59,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:38:59,607 INFO L87 Difference]: Start difference. First operand 113 states and 176 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29)