./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.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-ci_file-63.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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:18:03,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:18:03,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 12:18:03,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:18:03,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:18:03,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:18:03,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:18:03,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:18:03,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:18:03,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:18:03,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:18:03,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:18:03,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:18:03,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:18:03,458 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:18:03,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:18:03,459 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:18:03,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:18:03,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:18:03,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:18:03,460 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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2025-03-08 12:18:03,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:18:03,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:18:03,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:18:03,685 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:18:03,685 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:18:03,687 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-ci_file-63.i [2025-03-08 12:18:04,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f37dcd39/55087c4a90da4da99a9259aa4c4ed2bd/FLAG306cea5d5 [2025-03-08 12:18:05,045 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:18:05,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2025-03-08 12:18:05,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f37dcd39/55087c4a90da4da99a9259aa4c4ed2bd/FLAG306cea5d5 [2025-03-08 12:18:05,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f37dcd39/55087c4a90da4da99a9259aa4c4ed2bd [2025-03-08 12:18:05,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:18:05,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:18:05,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:18:05,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:18:05,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:18:05,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05, skipping insertion in model container [2025-03-08 12:18:05,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:18:05,513 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-ci_file-63.i[919,932] [2025-03-08 12:18:05,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:18:05,594 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:18:05,603 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-ci_file-63.i[919,932] [2025-03-08 12:18:05,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:18:05,659 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:18:05,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05 WrapperNode [2025-03-08 12:18:05,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:18:05,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:18:05,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:18:05,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:18:05,665 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:18:05" (1/1) ... [2025-03-08 12:18:05,678 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:18:05" (1/1) ... [2025-03-08 12:18:05,719 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2025-03-08 12:18:05,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:18:05,720 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:18:05,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:18:05,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:18:05,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,753 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:18:05,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:18:05,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:18:05,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:18:05,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:18:05,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (1/1) ... [2025-03-08 12:18:05,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:18:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:18:05,810 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:18:05,815 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:18:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:18:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:18:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:18:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 12:18:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:18:05,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:18:05,894 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:18:05,896 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:18:06,249 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L182: havoc property_#t~bitwise22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2025-03-08 12:18:06,278 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 12:18:06,279 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:18:06,296 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:18:06,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:18:06,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:06 BoogieIcfgContainer [2025-03-08 12:18:06,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:18:06,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:18:06,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:18:06,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:18:06,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:18:05" (1/3) ... [2025-03-08 12:18:06,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cde690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:06, skipping insertion in model container [2025-03-08 12:18:06,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:05" (2/3) ... [2025-03-08 12:18:06,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cde690e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:06, skipping insertion in model container [2025-03-08 12:18:06,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:06" (3/3) ... [2025-03-08 12:18:06,304 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2025-03-08 12:18:06,314 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:18:06,315 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:18:06,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:18:06,372 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;@340775ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:18:06,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:18:06,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 12:18:06,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:06,388 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:06,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1200890175, now seen corresponding path program 1 times [2025-03-08 12:18:06,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:06,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139733790] [2025-03-08 12:18:06,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:06,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 12:18:06,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 12:18:06,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:06,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 12:18:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139733790] [2025-03-08 12:18:06,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139733790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 12:18:06,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173670139] [2025-03-08 12:18:06,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:06,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 12:18:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:18:06,656 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:18:06,660 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:18:06,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 12:18:06,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 12:18:06,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:06,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:06,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:18:06,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:18:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 12:18:06,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:18:06,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173670139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:06,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 12:18:06,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 12:18:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454084896] [2025-03-08 12:18:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:06,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:18:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:06,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:18:06,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:18:06,858 INFO L87 Difference]: Start difference. First operand has 97 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 73 states have internal predecessors, (106), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:06,882 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2025-03-08 12:18:06,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:18:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 158 [2025-03-08 12:18:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:06,888 INFO L225 Difference]: With dead ends: 188 [2025-03-08 12:18:06,888 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 12:18:06,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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:18:06,893 INFO L435 NwaCegarLoop]: 139 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, 139 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:18:06,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:18:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 12:18:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 12:18:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2025-03-08 12:18:06,926 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 158 [2025-03-08 12:18:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:06,926 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2025-03-08 12:18:06,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2025-03-08 12:18:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 12:18:06,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:06,928 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:06,935 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:18:07,129 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:18:07,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:07,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 2117294521, now seen corresponding path program 1 times [2025-03-08 12:18:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:07,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713089744] [2025-03-08 12:18:07,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:07,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:07,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 12:18:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 12:18:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:07,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713089744] [2025-03-08 12:18:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713089744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:18:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577017087] [2025-03-08 12:18:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:18:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:07,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:18:07,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:18:07,380 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:07,463 INFO L93 Difference]: Finished difference Result 232 states and 361 transitions. [2025-03-08 12:18:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-03-08 12:18:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:07,469 INFO L225 Difference]: With dead ends: 232 [2025-03-08 12:18:07,471 INFO L226 Difference]: Without dead ends: 141 [2025-03-08 12:18:07,472 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:18:07,473 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 58 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:07,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:18:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-08 12:18:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2025-03-08 12:18:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 92 states have internal predecessors, (137), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2025-03-08 12:18:07,487 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 158 [2025-03-08 12:18:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:07,489 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2025-03-08 12:18:07,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2025-03-08 12:18:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 12:18:07,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:07,492 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:07,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 12:18:07,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:07,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:07,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1185038951, now seen corresponding path program 1 times [2025-03-08 12:18:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478535030] [2025-03-08 12:18:07,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:07,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 12:18:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 12:18:07,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:07,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478535030] [2025-03-08 12:18:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478535030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:07,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:07,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:18:07,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413063519] [2025-03-08 12:18:07,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:07,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:18:07,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:07,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:18:07,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:18:07,862 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:08,141 INFO L93 Difference]: Finished difference Result 358 states and 553 transitions. [2025-03-08 12:18:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:18:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2025-03-08 12:18:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:08,145 INFO L225 Difference]: With dead ends: 358 [2025-03-08 12:18:08,146 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 12:18:08,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:18:08,149 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 256 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:08,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 404 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 12:18:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 136. [2025-03-08 12:18:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.5) internal successors, (168), 112 states have internal predecessors, (168), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 212 transitions. [2025-03-08 12:18:08,170 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 212 transitions. Word has length 158 [2025-03-08 12:18:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:08,171 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 212 transitions. [2025-03-08 12:18:08,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 212 transitions. [2025-03-08 12:18:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 12:18:08,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:08,174 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 12:18:08,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:08,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash -577512949, now seen corresponding path program 1 times [2025-03-08 12:18:08,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:08,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490064041] [2025-03-08 12:18:08,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:08,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:08,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 12:18:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 12:18:08,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:08,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490064041] [2025-03-08 12:18:08,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490064041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:08,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:08,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:18:08,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854385603] [2025-03-08 12:18:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:08,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:18:08,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:08,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:18:08,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:18:08,422 INFO L87 Difference]: Start difference. First operand 136 states and 212 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:08,597 INFO L93 Difference]: Finished difference Result 387 states and 607 transitions. [2025-03-08 12:18:08,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:18:08,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2025-03-08 12:18:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:08,599 INFO L225 Difference]: With dead ends: 387 [2025-03-08 12:18:08,600 INFO L226 Difference]: Without dead ends: 243 [2025-03-08 12:18:08,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:18:08,601 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 250 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:08,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 246 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-08 12:18:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 179. [2025-03-08 12:18:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 155 states have (on average 1.5032258064516129) internal successors, (233), 155 states have internal predecessors, (233), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2025-03-08 12:18:08,624 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 159 [2025-03-08 12:18:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:08,626 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2025-03-08 12:18:08,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2025-03-08 12:18:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 12:18:08,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:08,628 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 12:18:08,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:08,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 359471340, now seen corresponding path program 1 times [2025-03-08 12:18:08,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:08,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512759587] [2025-03-08 12:18:08,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:08,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 12:18:08,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 12:18:08,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:08,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512759587] [2025-03-08 12:18:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512759587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:18:08,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381951543] [2025-03-08 12:18:08,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:08,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:18:08,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:08,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:18:08,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:18:08,722 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:08,794 INFO L93 Difference]: Finished difference Result 410 states and 630 transitions. [2025-03-08 12:18:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2025-03-08 12:18:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:08,796 INFO L225 Difference]: With dead ends: 410 [2025-03-08 12:18:08,796 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 12:18:08,796 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:18:08,797 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 103 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:08,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 245 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:18:08,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 12:18:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 179. [2025-03-08 12:18:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 155 states have (on average 1.4903225806451612) internal successors, (231), 155 states have internal predecessors, (231), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 275 transitions. [2025-03-08 12:18:08,818 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 275 transitions. Word has length 159 [2025-03-08 12:18:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:08,820 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 275 transitions. [2025-03-08 12:18:08,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 275 transitions. [2025-03-08 12:18:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:18:08,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:08,822 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:08,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 12:18:08,822 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:08,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 193019227, now seen corresponding path program 1 times [2025-03-08 12:18:08,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:08,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874448701] [2025-03-08 12:18:08,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:08,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:08,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:18:08,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:18:08,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:08,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:09,410 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:09,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874448701] [2025-03-08 12:18:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874448701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:18:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444248458] [2025-03-08 12:18:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:09,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:18:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:09,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:18:09,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:09,413 INFO L87 Difference]: Start difference. First operand 179 states and 275 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:09,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:09,728 INFO L93 Difference]: Finished difference Result 423 states and 644 transitions. [2025-03-08 12:18:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:18:09,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-08 12:18:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:09,730 INFO L225 Difference]: With dead ends: 423 [2025-03-08 12:18:09,730 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 12:18:09,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:09,732 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 86 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:09,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1150 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 12:18:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 194. [2025-03-08 12:18:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 170 states have (on average 1.4764705882352942) internal successors, (251), 170 states have internal predecessors, (251), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:09,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 295 transitions. [2025-03-08 12:18:09,756 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 295 transitions. Word has length 160 [2025-03-08 12:18:09,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:09,756 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 295 transitions. [2025-03-08 12:18:09,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 295 transitions. [2025-03-08 12:18:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 12:18:09,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:09,757 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:09,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 12:18:09,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -49646576, now seen corresponding path program 1 times [2025-03-08 12:18:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639677500] [2025-03-08 12:18:09,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:09,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 12:18:09,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 12:18:09,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:09,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:09,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:09,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639677500] [2025-03-08 12:18:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639677500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:09,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:09,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:18:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35995057] [2025-03-08 12:18:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:18:09,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:09,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:18:09,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:18:09,821 INFO L87 Difference]: Start difference. First operand 194 states and 295 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:09,894 INFO L93 Difference]: Finished difference Result 474 states and 716 transitions. [2025-03-08 12:18:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:09,895 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2025-03-08 12:18:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:09,898 INFO L225 Difference]: With dead ends: 474 [2025-03-08 12:18:09,898 INFO L226 Difference]: Without dead ends: 283 [2025-03-08 12:18:09,898 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:18:09,899 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 125 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:09,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 275 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:18:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-08 12:18:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 223. [2025-03-08 12:18:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 199 states have internal predecessors, (289), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 333 transitions. [2025-03-08 12:18:09,919 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 333 transitions. Word has length 160 [2025-03-08 12:18:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:09,919 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 333 transitions. [2025-03-08 12:18:09,919 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:09,919 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 333 transitions. [2025-03-08 12:18:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:09,920 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 12:18:09,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1534236564, now seen corresponding path program 1 times [2025-03-08 12:18:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143589959] [2025-03-08 12:18:09,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:09,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:09,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:09,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:09,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143589959] [2025-03-08 12:18:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143589959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:10,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:18:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588008925] [2025-03-08 12:18:10,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:10,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:18:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:10,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:18:10,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:10,142 INFO L87 Difference]: Start difference. First operand 223 states and 333 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:10,434 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2025-03-08 12:18:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:18:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:10,438 INFO L225 Difference]: With dead ends: 659 [2025-03-08 12:18:10,438 INFO L226 Difference]: Without dead ends: 439 [2025-03-08 12:18:10,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:10,439 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 136 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:10,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 662 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-08 12:18:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 313. [2025-03-08 12:18:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 289 states have (on average 1.4844290657439447) internal successors, (429), 289 states have internal predecessors, (429), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 473 transitions. [2025-03-08 12:18:10,471 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 473 transitions. Word has length 161 [2025-03-08 12:18:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:10,471 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 473 transitions. [2025-03-08 12:18:10,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 473 transitions. [2025-03-08 12:18:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:10,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:10,474 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:10,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 12:18:10,474 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1730750069, now seen corresponding path program 1 times [2025-03-08 12:18:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:10,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181805678] [2025-03-08 12:18:10,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:10,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:10,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:10,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:10,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181805678] [2025-03-08 12:18:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181805678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 12:18:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503458181] [2025-03-08 12:18:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:11,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:18:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:11,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:18:11,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:18:11,244 INFO L87 Difference]: Start difference. First operand 313 states and 473 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:12,165 INFO L93 Difference]: Finished difference Result 800 states and 1176 transitions. [2025-03-08 12:18:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:18:12,165 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:12,168 INFO L225 Difference]: With dead ends: 800 [2025-03-08 12:18:12,168 INFO L226 Difference]: Without dead ends: 490 [2025-03-08 12:18:12,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-08 12:18:12,169 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 317 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:12,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1628 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:18:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-08 12:18:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 320. [2025-03-08 12:18:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 296 states have (on average 1.4222972972972974) internal successors, (421), 296 states have internal predecessors, (421), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:12,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2025-03-08 12:18:12,195 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 161 [2025-03-08 12:18:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:12,195 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2025-03-08 12:18:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2025-03-08 12:18:12,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:12,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:12,197 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:12,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 12:18:12,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:12,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:12,198 INFO L85 PathProgramCache]: Analyzing trace with hash 683521389, now seen corresponding path program 1 times [2025-03-08 12:18:12,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:12,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117878577] [2025-03-08 12:18:12,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:12,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:12,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:12,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:12,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:12,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117878577] [2025-03-08 12:18:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117878577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:12,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 12:18:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134569595] [2025-03-08 12:18:12,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:12,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 12:18:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:12,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 12:18:12,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:12,642 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:12,949 INFO L93 Difference]: Finished difference Result 748 states and 1071 transitions. [2025-03-08 12:18:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:18:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:12,951 INFO L225 Difference]: With dead ends: 748 [2025-03-08 12:18:12,951 INFO L226 Difference]: Without dead ends: 431 [2025-03-08 12:18:12,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:18:12,952 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 82 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:12,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1136 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:12,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-08 12:18:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 305. [2025-03-08 12:18:12,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 281 states have (on average 1.4306049822064058) internal successors, (402), 281 states have internal predecessors, (402), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 446 transitions. [2025-03-08 12:18:12,996 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 446 transitions. Word has length 161 [2025-03-08 12:18:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:12,996 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 446 transitions. [2025-03-08 12:18:12,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 446 transitions. [2025-03-08 12:18:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:13,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:13,001 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:13,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 12:18:13,001 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:13,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1795204489, now seen corresponding path program 1 times [2025-03-08 12:18:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820267831] [2025-03-08 12:18:13,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:13,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:13,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:13,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:13,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820267831] [2025-03-08 12:18:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820267831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:14,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 12:18:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685608808] [2025-03-08 12:18:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 12:18:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 12:18:14,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:14,051 INFO L87 Difference]: Start difference. First operand 305 states and 446 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:14,895 INFO L93 Difference]: Finished difference Result 1384 states and 1974 transitions. [2025-03-08 12:18:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:18:14,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:14,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:14,914 INFO L225 Difference]: With dead ends: 1384 [2025-03-08 12:18:14,914 INFO L226 Difference]: Without dead ends: 1082 [2025-03-08 12:18:14,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:18:14,915 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 500 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:14,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 680 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:18:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-03-08 12:18:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 611. [2025-03-08 12:18:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 584 states have (on average 1.4606164383561644) internal successors, (853), 585 states have internal predecessors, (853), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 12:18:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 901 transitions. [2025-03-08 12:18:14,943 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 901 transitions. Word has length 161 [2025-03-08 12:18:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:14,943 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 901 transitions. [2025-03-08 12:18:14,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 901 transitions. [2025-03-08 12:18:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:14,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:14,945 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:14,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 12:18:14,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1655290936, now seen corresponding path program 1 times [2025-03-08 12:18:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999674460] [2025-03-08 12:18:14,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:14,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:14,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:14,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:14,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999674460] [2025-03-08 12:18:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999674460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:18:15,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725406724] [2025-03-08 12:18:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:15,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:18:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:15,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:18:15,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:15,479 INFO L87 Difference]: Start difference. First operand 611 states and 901 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:15,891 INFO L93 Difference]: Finished difference Result 1717 states and 2482 transitions. [2025-03-08 12:18:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 12:18:15,891 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:15,896 INFO L225 Difference]: With dead ends: 1717 [2025-03-08 12:18:15,896 INFO L226 Difference]: Without dead ends: 1109 [2025-03-08 12:18:15,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:15,897 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 360 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:15,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 466 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:18:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-08 12:18:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 670. [2025-03-08 12:18:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 643 states have (on average 1.4572317262830483) internal successors, (937), 644 states have internal predecessors, (937), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 12:18:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 985 transitions. [2025-03-08 12:18:15,926 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 985 transitions. Word has length 161 [2025-03-08 12:18:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:15,926 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 985 transitions. [2025-03-08 12:18:15,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 985 transitions. [2025-03-08 12:18:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:15,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:15,928 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 12:18:15,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:15,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash 673057431, now seen corresponding path program 1 times [2025-03-08 12:18:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594783434] [2025-03-08 12:18:15,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:15,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:15,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:15,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:15,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:15,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:16,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594783434] [2025-03-08 12:18:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594783434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:16,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:16,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:18:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926185144] [2025-03-08 12:18:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:16,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:18:16,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:16,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:18:16,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:16,192 INFO L87 Difference]: Start difference. First operand 670 states and 985 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:17,131 INFO L93 Difference]: Finished difference Result 1953 states and 2844 transitions. [2025-03-08 12:18:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:18:17,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:17,137 INFO L225 Difference]: With dead ends: 1953 [2025-03-08 12:18:17,137 INFO L226 Difference]: Without dead ends: 1286 [2025-03-08 12:18:17,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 12:18:17,138 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 415 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:17,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 773 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:18:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-03-08 12:18:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 983. [2025-03-08 12:18:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 906 states have (on average 1.4183222958057395) internal successors, (1285), 909 states have internal predecessors, (1285), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 12:18:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1425 transitions. [2025-03-08 12:18:17,213 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1425 transitions. Word has length 161 [2025-03-08 12:18:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:17,214 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1425 transitions. [2025-03-08 12:18:17,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:17,214 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1425 transitions. [2025-03-08 12:18:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:17,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:17,217 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:17,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 12:18:17,217 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:17,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -171414440, now seen corresponding path program 1 times [2025-03-08 12:18:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996797757] [2025-03-08 12:18:17,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:17,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:17,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996797757] [2025-03-08 12:18:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996797757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:18:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81300522] [2025-03-08 12:18:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:18:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:17,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:18:17,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:18:17,377 INFO L87 Difference]: Start difference. First operand 983 states and 1425 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:17,783 INFO L93 Difference]: Finished difference Result 2476 states and 3553 transitions. [2025-03-08 12:18:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 12:18:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:17,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:17,790 INFO L225 Difference]: With dead ends: 2476 [2025-03-08 12:18:17,790 INFO L226 Difference]: Without dead ends: 1541 [2025-03-08 12:18:17,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:17,792 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 198 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:17,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 477 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 12:18:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-03-08 12:18:17,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1087. [2025-03-08 12:18:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1010 states have (on average 1.400990099009901) internal successors, (1415), 1013 states have internal predecessors, (1415), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 12:18:17,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1555 transitions. [2025-03-08 12:18:17,862 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1555 transitions. Word has length 161 [2025-03-08 12:18:17,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:17,862 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1555 transitions. [2025-03-08 12:18:17,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:17,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1555 transitions. [2025-03-08 12:18:17,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:17,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:17,864 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 12:18:17,865 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash -238421193, now seen corresponding path program 1 times [2025-03-08 12:18:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650442] [2025-03-08 12:18:17,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:17,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:17,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:17,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:17,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:17,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:18,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650442] [2025-03-08 12:18:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:18:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394068300] [2025-03-08 12:18:18,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 12:18:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:18,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 12:18:18,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:18:18,058 INFO L87 Difference]: Start difference. First operand 1087 states and 1555 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:18,266 INFO L93 Difference]: Finished difference Result 2781 states and 3978 transitions. [2025-03-08 12:18:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:18,273 INFO L225 Difference]: With dead ends: 2781 [2025-03-08 12:18:18,273 INFO L226 Difference]: Without dead ends: 1742 [2025-03-08 12:18:18,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 12:18:18,276 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 91 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:18,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 382 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:18:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-08 12:18:18,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1740. [2025-03-08 12:18:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1611 states have (on average 1.3842333954065797) internal successors, (2230), 1616 states have internal predecessors, (2230), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2466 transitions. [2025-03-08 12:18:18,378 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2466 transitions. Word has length 161 [2025-03-08 12:18:18,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:18,378 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2466 transitions. [2025-03-08 12:18:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2466 transitions. [2025-03-08 12:18:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 12:18:18,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:18,382 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:18,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 12:18:18,383 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:18,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:18,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1461918632, now seen corresponding path program 1 times [2025-03-08 12:18:18,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:18,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789577839] [2025-03-08 12:18:18,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:18,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:18,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 12:18:18,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 12:18:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:18,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789577839] [2025-03-08 12:18:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789577839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:18:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190205858] [2025-03-08 12:18:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:18:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:18,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:18:18,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:18,563 INFO L87 Difference]: Start difference. First operand 1740 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:18,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:18,967 INFO L93 Difference]: Finished difference Result 3872 states and 5470 transitions. [2025-03-08 12:18:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 12:18:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2025-03-08 12:18:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:18,976 INFO L225 Difference]: With dead ends: 3872 [2025-03-08 12:18:18,976 INFO L226 Difference]: Without dead ends: 2180 [2025-03-08 12:18:18,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:18,979 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 99 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:18,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 827 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-03-08 12:18:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1876. [2025-03-08 12:18:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1876 states, 1747 states have (on average 1.3732112192329708) internal successors, (2399), 1752 states have internal predecessors, (2399), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 2635 transitions. [2025-03-08 12:18:19,111 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 2635 transitions. Word has length 161 [2025-03-08 12:18:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 1876 states and 2635 transitions. [2025-03-08 12:18:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 2635 transitions. [2025-03-08 12:18:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:19,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:19,114 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:19,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 12:18:19,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:19,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1585100452, now seen corresponding path program 1 times [2025-03-08 12:18:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:19,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902930411] [2025-03-08 12:18:19,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:19,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:19,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:19,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:19,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902930411] [2025-03-08 12:18:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902930411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:19,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 12:18:19,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657610681] [2025-03-08 12:18:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:19,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 12:18:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:19,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 12:18:19,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:18:19,505 INFO L87 Difference]: Start difference. First operand 1876 states and 2635 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:20,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:20,174 INFO L93 Difference]: Finished difference Result 4473 states and 6163 transitions. [2025-03-08 12:18:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 12:18:20,175 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:20,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:20,183 INFO L225 Difference]: With dead ends: 4473 [2025-03-08 12:18:20,183 INFO L226 Difference]: Without dead ends: 2645 [2025-03-08 12:18:20,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-08 12:18:20,187 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 338 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:20,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1431 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:18:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2025-03-08 12:18:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1874. [2025-03-08 12:18:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1745 states have (on average 1.3736389684813755) internal successors, (2397), 1750 states have internal predecessors, (2397), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2633 transitions. [2025-03-08 12:18:20,295 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2633 transitions. Word has length 162 [2025-03-08 12:18:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:20,295 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2633 transitions. [2025-03-08 12:18:20,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2633 transitions. [2025-03-08 12:18:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:20,297 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:20,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 12:18:20,298 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:20,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash 860190813, now seen corresponding path program 1 times [2025-03-08 12:18:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:20,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103845862] [2025-03-08 12:18:20,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:20,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:20,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:20,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:20,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:20,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:20,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103845862] [2025-03-08 12:18:20,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103845862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:20,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:20,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 12:18:20,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876387338] [2025-03-08 12:18:20,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:20,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 12:18:20,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:20,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 12:18:20,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:20,631 INFO L87 Difference]: Start difference. First operand 1874 states and 2633 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:20,907 INFO L93 Difference]: Finished difference Result 4427 states and 6114 transitions. [2025-03-08 12:18:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:18:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:20,916 INFO L225 Difference]: With dead ends: 4427 [2025-03-08 12:18:20,916 INFO L226 Difference]: Without dead ends: 2601 [2025-03-08 12:18:20,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:18:20,920 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 99 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:20,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 946 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2025-03-08 12:18:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1750. [2025-03-08 12:18:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1750 states, 1621 states have (on average 1.3793954349167181) internal successors, (2236), 1626 states have internal predecessors, (2236), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2472 transitions. [2025-03-08 12:18:21,020 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 2472 transitions. Word has length 162 [2025-03-08 12:18:21,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:21,020 INFO L471 AbstractCegarLoop]: Abstraction has 1750 states and 2472 transitions. [2025-03-08 12:18:21,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:21,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 2472 transitions. [2025-03-08 12:18:21,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:21,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:21,022 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 12:18:21,023 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:21,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash 110566904, now seen corresponding path program 1 times [2025-03-08 12:18:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:21,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576339430] [2025-03-08 12:18:21,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:21,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:21,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:21,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:21,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:21,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576339430] [2025-03-08 12:18:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576339430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:18:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785250879] [2025-03-08 12:18:21,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:21,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:18:21,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:21,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:18:21,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:21,217 INFO L87 Difference]: Start difference. First operand 1750 states and 2472 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:21,877 INFO L93 Difference]: Finished difference Result 4063 states and 5726 transitions. [2025-03-08 12:18:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:18:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:21,887 INFO L225 Difference]: With dead ends: 4063 [2025-03-08 12:18:21,887 INFO L226 Difference]: Without dead ends: 2359 [2025-03-08 12:18:21,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:18:21,889 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 338 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:21,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 823 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 12:18:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2025-03-08 12:18:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1824. [2025-03-08 12:18:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1695 states have (on average 1.3710914454277285) internal successors, (2324), 1700 states have internal predecessors, (2324), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2560 transitions. [2025-03-08 12:18:22,011 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2560 transitions. Word has length 162 [2025-03-08 12:18:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2560 transitions. [2025-03-08 12:18:22,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:22,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2560 transitions. [2025-03-08 12:18:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:22,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:22,014 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:22,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 12:18:22,014 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:22,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2064705351, now seen corresponding path program 1 times [2025-03-08 12:18:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41272580] [2025-03-08 12:18:22,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:22,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:22,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:22,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:22,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:22,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:22,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41272580] [2025-03-08 12:18:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41272580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:22,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:18:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276886510] [2025-03-08 12:18:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:22,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:18:22,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:22,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:18:22,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:22,239 INFO L87 Difference]: Start difference. First operand 1824 states and 2560 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:23,008 INFO L93 Difference]: Finished difference Result 3846 states and 5392 transitions. [2025-03-08 12:18:23,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 12:18:23,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:23,016 INFO L225 Difference]: With dead ends: 3846 [2025-03-08 12:18:23,016 INFO L226 Difference]: Without dead ends: 2070 [2025-03-08 12:18:23,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 12:18:23,019 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:23,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1068 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 12:18:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2025-03-08 12:18:23,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1787. [2025-03-08 12:18:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1787 states, 1658 states have (on average 1.3685162846803378) internal successors, (2269), 1663 states have internal predecessors, (2269), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2505 transitions. [2025-03-08 12:18:23,114 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2505 transitions. Word has length 162 [2025-03-08 12:18:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:23,114 INFO L471 AbstractCegarLoop]: Abstraction has 1787 states and 2505 transitions. [2025-03-08 12:18:23,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2505 transitions. [2025-03-08 12:18:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:23,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:23,116 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 12:18:23,116 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1160397009, now seen corresponding path program 1 times [2025-03-08 12:18:23,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:23,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210471311] [2025-03-08 12:18:23,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:23,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:23,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:23,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:23,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:23,151 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210471311] [2025-03-08 12:18:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210471311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:18:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676326257] [2025-03-08 12:18:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:18:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:23,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:18:23,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:18:23,153 INFO L87 Difference]: Start difference. First operand 1787 states and 2505 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:23,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:23,335 INFO L93 Difference]: Finished difference Result 3967 states and 5586 transitions. [2025-03-08 12:18:23,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:23,336 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:23,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:23,342 INFO L225 Difference]: With dead ends: 3967 [2025-03-08 12:18:23,342 INFO L226 Difference]: Without dead ends: 2228 [2025-03-08 12:18:23,344 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:18:23,345 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 118 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:23,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 265 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:18:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-08 12:18:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1755. [2025-03-08 12:18:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1626 states have (on average 1.3757687576875768) internal successors, (2237), 1631 states have internal predecessors, (2237), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 113 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 12:18:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2473 transitions. [2025-03-08 12:18:23,449 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2473 transitions. Word has length 162 [2025-03-08 12:18:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:23,450 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2473 transitions. [2025-03-08 12:18:23,450 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2473 transitions. [2025-03-08 12:18:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:23,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:23,451 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 12:18:23,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:23,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:23,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1315127722, now seen corresponding path program 1 times [2025-03-08 12:18:23,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630237567] [2025-03-08 12:18:23,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:23,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:23,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:23,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:23,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:23,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630237567] [2025-03-08 12:18:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630237567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:18:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008130710] [2025-03-08 12:18:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:24,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:18:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:24,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:18:24,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:18:24,384 INFO L87 Difference]: Start difference. First operand 1755 states and 2473 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:25,774 INFO L93 Difference]: Finished difference Result 3309 states and 4615 transitions. [2025-03-08 12:18:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 12:18:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:25,780 INFO L225 Difference]: With dead ends: 3309 [2025-03-08 12:18:25,780 INFO L226 Difference]: Without dead ends: 2254 [2025-03-08 12:18:25,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:18:25,784 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 658 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:25,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 676 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 12:18:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-03-08 12:18:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2055. [2025-03-08 12:18:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1914 states have (on average 1.3672936259143156) internal successors, (2617), 1921 states have internal predecessors, (2617), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 12:18:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2869 transitions. [2025-03-08 12:18:25,913 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2869 transitions. Word has length 162 [2025-03-08 12:18:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:25,913 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 2869 transitions. [2025-03-08 12:18:25,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2869 transitions. [2025-03-08 12:18:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:25,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:25,916 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:25,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 12:18:25,916 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:25,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:25,916 INFO L85 PathProgramCache]: Analyzing trace with hash -588842667, now seen corresponding path program 1 times [2025-03-08 12:18:25,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:25,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107015636] [2025-03-08 12:18:25,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:25,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:25,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:25,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107015636] [2025-03-08 12:18:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107015636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 12:18:26,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935896594] [2025-03-08 12:18:26,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:26,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 12:18:26,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:26,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 12:18:26,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:26,333 INFO L87 Difference]: Start difference. First operand 2055 states and 2869 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:27,220 INFO L93 Difference]: Finished difference Result 5283 states and 7171 transitions. [2025-03-08 12:18:27,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:18:27,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2025-03-08 12:18:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:27,227 INFO L225 Difference]: With dead ends: 5283 [2025-03-08 12:18:27,228 INFO L226 Difference]: Without dead ends: 3276 [2025-03-08 12:18:27,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:18:27,230 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 387 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:27,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1152 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:18:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-03-08 12:18:27,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 2115. [2025-03-08 12:18:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 1974 states have (on average 1.3682877406281662) internal successors, (2701), 1981 states have internal predecessors, (2701), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 12:18:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2953 transitions. [2025-03-08 12:18:27,367 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2953 transitions. Word has length 162 [2025-03-08 12:18:27,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:27,367 INFO L471 AbstractCegarLoop]: Abstraction has 2115 states and 2953 transitions. [2025-03-08 12:18:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2953 transitions. [2025-03-08 12:18:27,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-08 12:18:27,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:27,370 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 12:18:27,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1220091061, now seen corresponding path program 1 times [2025-03-08 12:18:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:27,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680535178] [2025-03-08 12:18:27,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:27,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-08 12:18:27,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-08 12:18:27,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:27,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680535178] [2025-03-08 12:18:27,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680535178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:27,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:27,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 12:18:27,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290163259] [2025-03-08 12:18:27,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 12:18:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:27,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 12:18:27,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:27,507 INFO L87 Difference]: Start difference. First operand 2115 states and 2953 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:27,861 INFO L93 Difference]: Finished difference Result 4172 states and 5823 transitions. [2025-03-08 12:18:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:18:27,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 162 [2025-03-08 12:18:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:27,868 INFO L225 Difference]: With dead ends: 4172 [2025-03-08 12:18:27,869 INFO L226 Difference]: Without dead ends: 2105 [2025-03-08 12:18:27,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:18:27,872 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 181 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:27,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 591 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2025-03-08 12:18:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 2103. [2025-03-08 12:18:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2103 states, 1962 states have (on average 1.3623853211009174) internal successors, (2673), 1969 states have internal predecessors, (2673), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 12:18:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2103 states to 2103 states and 2925 transitions. [2025-03-08 12:18:27,993 INFO L78 Accepts]: Start accepts. Automaton has 2103 states and 2925 transitions. Word has length 162 [2025-03-08 12:18:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:27,993 INFO L471 AbstractCegarLoop]: Abstraction has 2103 states and 2925 transitions. [2025-03-08 12:18:27,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:27,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2103 states and 2925 transitions. [2025-03-08 12:18:27,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:27,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:27,995 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:27,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 12:18:27,995 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:27,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 476284630, now seen corresponding path program 1 times [2025-03-08 12:18:27,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:27,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847811734] [2025-03-08 12:18:27,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:28,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:28,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:28,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:28,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847811734] [2025-03-08 12:18:28,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847811734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:28,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:28,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 12:18:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615903966] [2025-03-08 12:18:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:28,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 12:18:28,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:28,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 12:18:28,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 12:18:28,217 INFO L87 Difference]: Start difference. First operand 2103 states and 2925 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:29,574 INFO L93 Difference]: Finished difference Result 5567 states and 7674 transitions. [2025-03-08 12:18:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 12:18:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:29,584 INFO L225 Difference]: With dead ends: 5567 [2025-03-08 12:18:29,584 INFO L226 Difference]: Without dead ends: 3512 [2025-03-08 12:18:29,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:18:29,587 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 706 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:29,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 618 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 12:18:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2025-03-08 12:18:29,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 2169. [2025-03-08 12:18:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2028 states have (on average 1.356015779092702) internal successors, (2750), 2035 states have internal predecessors, (2750), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 12:18:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3002 transitions. [2025-03-08 12:18:29,845 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3002 transitions. Word has length 163 [2025-03-08 12:18:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3002 transitions. [2025-03-08 12:18:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3002 transitions. [2025-03-08 12:18:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:29,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:29,847 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 12:18:29,848 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:29,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash -29273995, now seen corresponding path program 1 times [2025-03-08 12:18:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350933592] [2025-03-08 12:18:29,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:29,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:29,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:29,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:29,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:30,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:30,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350933592] [2025-03-08 12:18:30,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350933592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:30,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:30,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 12:18:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353580094] [2025-03-08 12:18:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:30,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 12:18:30,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:30,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 12:18:30,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 12:18:30,237 INFO L87 Difference]: Start difference. First operand 2169 states and 3002 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:31,080 INFO L93 Difference]: Finished difference Result 5299 states and 7173 transitions. [2025-03-08 12:18:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 12:18:31,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:31,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:31,088 INFO L225 Difference]: With dead ends: 5299 [2025-03-08 12:18:31,088 INFO L226 Difference]: Without dead ends: 3178 [2025-03-08 12:18:31,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-08 12:18:31,092 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 401 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:31,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1086 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 12:18:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2025-03-08 12:18:31,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 2144. [2025-03-08 12:18:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2003 states have (on average 1.3554667998002996) internal successors, (2715), 2010 states have internal predecessors, (2715), 126 states have call successors, (126), 14 states have call predecessors, (126), 14 states have return successors, (126), 119 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-08 12:18:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 2967 transitions. [2025-03-08 12:18:31,237 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 2967 transitions. Word has length 163 [2025-03-08 12:18:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:31,237 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 2967 transitions. [2025-03-08 12:18:31,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 2967 transitions. [2025-03-08 12:18:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:31,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:31,240 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 12:18:31,240 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1309422697, now seen corresponding path program 1 times [2025-03-08 12:18:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565319293] [2025-03-08 12:18:31,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:31,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:31,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:31,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:31,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:31,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:31,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565319293] [2025-03-08 12:18:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565319293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:18:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85814558] [2025-03-08 12:18:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:18:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:31,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:18:31,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:18:31,565 INFO L87 Difference]: Start difference. First operand 2144 states and 2967 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:31,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:31,877 INFO L93 Difference]: Finished difference Result 4294 states and 5922 transitions. [2025-03-08 12:18:31,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:18:31,878 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:31,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:31,885 INFO L225 Difference]: With dead ends: 4294 [2025-03-08 12:18:31,886 INFO L226 Difference]: Without dead ends: 2177 [2025-03-08 12:18:31,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 12:18:31,890 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 254 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:31,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 376 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:18:31,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2025-03-08 12:18:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 2055. [2025-03-08 12:18:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1908 states have (on average 1.3527253668763102) internal successors, (2581), 1916 states have internal predecessors, (2581), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 12:18:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2841 transitions. [2025-03-08 12:18:32,039 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2841 transitions. Word has length 163 [2025-03-08 12:18:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:32,039 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 2841 transitions. [2025-03-08 12:18:32,039 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2841 transitions. [2025-03-08 12:18:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:32,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:32,041 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:32,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 12:18:32,041 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:32,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1924871991, now seen corresponding path program 1 times [2025-03-08 12:18:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046155537] [2025-03-08 12:18:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:32,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:32,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:32,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:32,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:32,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046155537] [2025-03-08 12:18:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046155537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:32,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 12:18:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466332469] [2025-03-08 12:18:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:32,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 12:18:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:32,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 12:18:32,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 12:18:32,501 INFO L87 Difference]: Start difference. First operand 2055 states and 2841 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:32,881 INFO L93 Difference]: Finished difference Result 3459 states and 4779 transitions. [2025-03-08 12:18:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 12:18:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:32,886 INFO L225 Difference]: With dead ends: 3459 [2025-03-08 12:18:32,887 INFO L226 Difference]: Without dead ends: 2100 [2025-03-08 12:18:32,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 12:18:32,890 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 216 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 452 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 12:18:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-03-08 12:18:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2055. [2025-03-08 12:18:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1908 states have (on average 1.35167714884696) internal successors, (2579), 1916 states have internal predecessors, (2579), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 122 states have call predecessors, (130), 130 states have call successors, (130) [2025-03-08 12:18:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2839 transitions. [2025-03-08 12:18:33,053 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2839 transitions. Word has length 163 [2025-03-08 12:18:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:33,054 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 2839 transitions. [2025-03-08 12:18:33,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2839 transitions. [2025-03-08 12:18:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:33,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:33,056 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:33,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 12:18:33,056 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:33,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1893852184, now seen corresponding path program 1 times [2025-03-08 12:18:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724324367] [2025-03-08 12:18:33,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:33,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:33,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:33,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:33,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:33,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724324367] [2025-03-08 12:18:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724324367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:18:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603508901] [2025-03-08 12:18:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:18:33,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:33,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:18:33,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:18:33,253 INFO L87 Difference]: Start difference. First operand 2055 states and 2839 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:33,536 INFO L93 Difference]: Finished difference Result 3810 states and 5240 transitions. [2025-03-08 12:18:33,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:18:33,537 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:33,542 INFO L225 Difference]: With dead ends: 3810 [2025-03-08 12:18:33,542 INFO L226 Difference]: Without dead ends: 2479 [2025-03-08 12:18:33,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:18:33,545 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 103 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:33,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 432 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:18:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-03-08 12:18:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2473. [2025-03-08 12:18:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2305 states have (on average 1.3383947939262473) internal successors, (3085), 2317 states have internal predecessors, (3085), 146 states have call successors, (146), 21 states have call predecessors, (146), 21 states have return successors, (146), 134 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-08 12:18:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3377 transitions. [2025-03-08 12:18:33,826 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3377 transitions. Word has length 163 [2025-03-08 12:18:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:33,827 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3377 transitions. [2025-03-08 12:18:33,827 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3377 transitions. [2025-03-08 12:18:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:33,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:33,830 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:33,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 12:18:33,830 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:33,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1061320886, now seen corresponding path program 1 times [2025-03-08 12:18:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:33,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277947954] [2025-03-08 12:18:33,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:33,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:33,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:33,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:34,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 12:18:34,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277947954] [2025-03-08 12:18:34,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277947954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:34,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:34,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 12:18:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318183734] [2025-03-08 12:18:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:18:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 12:18:34,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:18:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:18:34,030 INFO L87 Difference]: Start difference. First operand 2473 states and 3377 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:34,320 INFO L93 Difference]: Finished difference Result 5566 states and 7567 transitions. [2025-03-08 12:18:34,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:18:34,320 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2025-03-08 12:18:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:34,331 INFO L225 Difference]: With dead ends: 5566 [2025-03-08 12:18:34,332 INFO L226 Difference]: Without dead ends: 3145 [2025-03-08 12:18:34,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:18:34,336 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 139 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 12:18:34,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 463 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 12:18:34,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3145 states. [2025-03-08 12:18:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3145 to 2475. [2025-03-08 12:18:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2475 states, 2307 states have (on average 1.3381014304291288) internal successors, (3087), 2318 states have internal predecessors, (3087), 146 states have call successors, (146), 21 states have call predecessors, (146), 21 states have return successors, (146), 135 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-08 12:18:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3379 transitions. [2025-03-08 12:18:34,558 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3379 transitions. Word has length 163 [2025-03-08 12:18:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:34,559 INFO L471 AbstractCegarLoop]: Abstraction has 2475 states and 3379 transitions. [2025-03-08 12:18:34,559 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3379 transitions. [2025-03-08 12:18:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 12:18:34,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:34,560 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:34,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 12:18:34,560 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1960052600, now seen corresponding path program 1 times [2025-03-08 12:18:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 12:18:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285432922] [2025-03-08 12:18:34,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 12:18:34,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:34,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:34,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:34,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:18:34,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 12:18:34,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 12:18:34,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 12:18:34,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:34,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 12:18:34,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 12:18:34,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 12:18:34,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 12:18:34,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 12:18:34,696 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 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:18:34,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 12:18:34,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:18:34 BoogieIcfgContainer [2025-03-08 12:18:34,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 12:18:34,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 12:18:34,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 12:18:34,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 12:18:34,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:06" (3/4) ... [2025-03-08 12:18:34,807 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 12:18:34,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 12:18:34,808 INFO L158 Benchmark]: Toolchain (without parser) took 29413.56ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 106.3MB in the beginning and 886.2MB in the end (delta: -779.8MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2025-03-08 12:18:34,808 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:18:34,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 90.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 12:18:34,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.95ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 85.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 12:18:34,809 INFO L158 Benchmark]: Boogie Preprocessor took 60.72ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 80.0MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:18:34,809 INFO L158 Benchmark]: IcfgBuilder took 515.24ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 48.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 12:18:34,809 INFO L158 Benchmark]: TraceAbstraction took 28506.19ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 47.5MB in the beginning and 886.5MB in the end (delta: -839.0MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. [2025-03-08 12:18:34,809 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 1.1GB. Free memory was 886.5MB in the beginning and 886.2MB in the end (delta: 350.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 12:18:34,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 90.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.95ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 85.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.72ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 80.0MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 515.24ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 48.5MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28506.19ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 947.9MB). Free memory was 47.5MB in the beginning and 886.5MB in the end (delta: -839.0MB). Peak memory consumption was 109.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 1.1GB. Free memory was 886.5MB in the beginning and 886.2MB in the end (delta: 350.8kB). 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 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 154, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 152. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 [L65] var_1_55 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L66] COND FALSE !(\read(var_1_7)) [L69] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L71] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L74] COND FALSE !(var_1_21 > (var_1_21 + var_1_23)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=64, var_1_7=0] [L81] var_1_48 = var_1_15 [L82] var_1_32 = var_1_16 [L83] var_1_54 = var_1_18 [L84] var_1_30 = var_1_32 [L85] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L86] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L86] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L87] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L89] COND TRUE (-32 & var_1_15) > var_1_11 [L90] var_1_40 = ((((var_1_21) > (var_1_19)) ? (var_1_21) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L94] COND TRUE var_1_19 >= ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L95] COND FALSE !(var_1_30 > var_1_16) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L105] COND TRUE var_1_21 < var_1_22 [L106] var_1_49 = ((var_1_50 - var_1_51) + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L110] COND TRUE var_1_11 >= var_1_30 [L111] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=256, var_1_54=507, var_1_55=64, var_1_7=0] [L113] var_1_53 = var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L114] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L114] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L115] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L123] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L124] COND TRUE ! var_1_7 [L125] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L133] EXPR var_1_30 ^ var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L133] EXPR var_1_13 | var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L133] COND TRUE (var_1_30 ^ var_1_32) < (var_1_13 | var_1_11) [L134] var_1_33 = ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=-2, var_1_16=0, var_1_17=505, var_1_18=507, var_1_19=506, var_1_1=8, var_1_21=506, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=63, var_1_28=-59, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_40=506, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-1, var_1_50=63, var_1_51=5, var_1_53=64, var_1_54=507, var_1_55=64, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 172 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 31, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7299 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7299 mSDsluCounter, 20158 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14552 mSDsCounter, 1139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11040 IncrementalHoareTripleChecker+Invalid, 12179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1139 mSolverCounterUnsat, 5606 mSDtfsCounter, 11040 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2475occurred in iteration=30, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 10256 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 5156 NumberOfCodeBlocks, 5156 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4962 ConstructedInterpolants, 0 QuantifiedInterpolants, 18988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 31 InterpolantComputations, 30 PerfectInterpolantSequences, 28602/28644 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:18:34,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.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 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 12:18:36,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 12:18:36,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 12:18:36,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 12:18:36,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 12:18:36,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 12:18:36,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 12:18:36,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 12:18:36,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 12:18:36,817 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 12:18:36,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 12:18:36,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 12:18:36,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 12:18:36,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 12:18:36,818 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 12:18:36,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 12:18:36,819 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 12:18:36,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:18:36,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 12:18:36,820 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 12:18:36,820 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 -> 3fc583e741ffe99075b24df1c1eb2737969039ee55b26e24229cc0be1d9190a8 [2025-03-08 12:18:37,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 12:18:37,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 12:18:37,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 12:18:37,034 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 12:18:37,036 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 12:18:37,037 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-ci_file-63.i [2025-03-08 12:18:38,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4d4d3c/7317aa11044749e68cc962c96b357a21/FLAGd59b3b324 [2025-03-08 12:18:38,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 12:18:38,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2025-03-08 12:18:38,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4d4d3c/7317aa11044749e68cc962c96b357a21/FLAGd59b3b324 [2025-03-08 12:18:38,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4d4d3c/7317aa11044749e68cc962c96b357a21 [2025-03-08 12:18:38,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 12:18:38,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 12:18:38,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 12:18:38,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 12:18:38,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 12:18:38,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bba35f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38, skipping insertion in model container [2025-03-08 12:18:38,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 12:18:38,565 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-ci_file-63.i[919,932] [2025-03-08 12:18:38,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:18:38,642 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 12:18:38,650 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-ci_file-63.i[919,932] [2025-03-08 12:18:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 12:18:38,687 INFO L204 MainTranslator]: Completed translation [2025-03-08 12:18:38,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38 WrapperNode [2025-03-08 12:18:38,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 12:18:38,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 12:18:38,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 12:18:38,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 12:18:38,693 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:18:38" (1/1) ... [2025-03-08 12:18:38,706 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:18:38" (1/1) ... [2025-03-08 12:18:38,733 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-03-08 12:18:38,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 12:18:38,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 12:18:38,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 12:18:38,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 12:18:38,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,751 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:18:38,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 12:18:38,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 12:18:38,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 12:18:38,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 12:18:38,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (1/1) ... [2025-03-08 12:18:38,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 12:18:38,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 12:18:38,807 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:18:38,813 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:18:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 12:18:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 12:18:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 12:18:38,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 12:18:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 12:18:38,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 12:18:38,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 12:18:38,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 12:18:45,902 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 12:18:45,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 12:18:45,909 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 12:18:45,911 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 12:18:45,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:45 BoogieIcfgContainer [2025-03-08 12:18:45,912 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 12:18:45,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 12:18:45,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 12:18:45,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 12:18:45,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:18:38" (1/3) ... [2025-03-08 12:18:45,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b82937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:45, skipping insertion in model container [2025-03-08 12:18:45,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:18:38" (2/3) ... [2025-03-08 12:18:45,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b82937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:18:45, skipping insertion in model container [2025-03-08 12:18:45,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:18:45" (3/3) ... [2025-03-08 12:18:45,919 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i [2025-03-08 12:18:45,928 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 12:18:45,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-63.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 12:18:45,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 12:18:45,973 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;@b84d6ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 12:18:45,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 12:18:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 12:18:45,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:45,986 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:45,986 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:45,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash -663054953, now seen corresponding path program 1 times [2025-03-08 12:18:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:18:45,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828609878] [2025-03-08 12:18:45,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:45,998 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:18:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:18:46,000 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:18:46,001 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:18:46,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 12:18:46,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 12:18:46,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:46,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:46,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 12:18:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:18:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-08 12:18:46,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:18:46,441 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:18:46,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828609878] [2025-03-08 12:18:46,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828609878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:46,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:46,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 12:18:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321833939] [2025-03-08 12:18:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:46,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 12:18:46,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:18:46,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 12:18:46,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 12:18:46,462 INFO L87 Difference]: Start difference. First operand has 76 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:46,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:18:46,477 INFO L93 Difference]: Finished difference Result 146 states and 251 transitions. [2025-03-08 12:18:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 12:18:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2025-03-08 12:18:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:18:46,483 INFO L225 Difference]: With dead ends: 146 [2025-03-08 12:18:46,483 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 12:18:46,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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:18:46,486 INFO L435 NwaCegarLoop]: 112 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, 112 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:18:46,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 12:18:46,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 12:18:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 12:18:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 12:18:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2025-03-08 12:18:46,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 150 [2025-03-08 12:18:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:18:46,515 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-03-08 12:18:46,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 12:18:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2025-03-08 12:18:46,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 12:18:46,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:18:46,518 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:46,534 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:18:46,718 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:18:46,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:18:46,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:18:46,719 INFO L85 PathProgramCache]: Analyzing trace with hash 787408913, now seen corresponding path program 1 times [2025-03-08 12:18:46,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:18:46,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878456273] [2025-03-08 12:18:46,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:18:46,720 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:18:46,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:18:46,722 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:18:46,723 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:18:46,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 12:18:47,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 12:18:47,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:18:47,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:18:47,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 12:18:47,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:18:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:18:48,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:18:48,641 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:18:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878456273] [2025-03-08 12:18:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878456273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:18:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:18:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 12:18:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138996316] [2025-03-08 12:18:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:18:48,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 12:18:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:18:48,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 12:18:48,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 12:18:48,646 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:18:51,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:18:55,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:18:57,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:19:01,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:19:05,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:19:05,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:19:05,700 INFO L93 Difference]: Finished difference Result 214 states and 331 transitions. [2025-03-08 12:19:05,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 12:19:05,729 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-08 12:19:05,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:19:05,731 INFO L225 Difference]: With dead ends: 214 [2025-03-08 12:19:05,731 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 12:19:05,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 12:19:05,735 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 96 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2025-03-08 12:19:05,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 363 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 79 Invalid, 1 Unknown, 0 Unchecked, 16.9s Time] [2025-03-08 12:19:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 12:19:05,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2025-03-08 12:19:05,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 12:19:05,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 176 transitions. [2025-03-08 12:19:05,764 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 176 transitions. Word has length 150 [2025-03-08 12:19:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:19:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 176 transitions. [2025-03-08 12:19:05,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:19:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 176 transitions. [2025-03-08 12:19:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 12:19:05,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:19:05,769 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:05,784 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:19:05,970 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:19:05,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:19:05,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:19:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash 998759826, now seen corresponding path program 1 times [2025-03-08 12:19:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:19:05,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341487856] [2025-03-08 12:19:05,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:19:05,972 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:19:05,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:19:05,974 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:19:05,976 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:19:06,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 12:19:06,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 12:19:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:19:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:19:06,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 12:19:06,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 12:19:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-08 12:19:06,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 12:19:06,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 12:19:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341487856] [2025-03-08 12:19:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341487856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 12:19:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 12:19:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 12:19:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893922329] [2025-03-08 12:19:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 12:19:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 12:19:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 12:19:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 12:19:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 12:19:06,411 INFO L87 Difference]: Start difference. First operand 116 states and 176 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:19:10,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 12:19:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 12:19:10,765 INFO L93 Difference]: Finished difference Result 212 states and 326 transitions. [2025-03-08 12:19:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 12:19:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2025-03-08 12:19:10,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 12:19:10,767 INFO L225 Difference]: With dead ends: 212 [2025-03-08 12:19:10,767 INFO L226 Difference]: Without dead ends: 142 [2025-03-08 12:19:10,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 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:19:10,768 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 12:19:10,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 216 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 12:19:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-08 12:19:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2025-03-08 12:19:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 12:19:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2025-03-08 12:19:10,786 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 150 [2025-03-08 12:19:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 12:19:10,787 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2025-03-08 12:19:10,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-03-08 12:19:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2025-03-08 12:19:10,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 12:19:10,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 12:19:10,794 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:10,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-08 12:19:10,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 12:19:10,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 12:19:10,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 12:19:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1687473, now seen corresponding path program 1 times [2025-03-08 12:19:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 12:19:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031390438] [2025-03-08 12:19:10,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 12:19:10,996 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:19:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 12:19:10,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 12:19:11,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 12:19:11,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 12:19:11,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 12:19:11,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 12:19:11,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 12:19:11,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 12:19:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates...