./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c --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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c -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 b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:56:05,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:56:05,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:56:05,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:56:05,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:56:05,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:56:05,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:56:05,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:56:05,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:56:05,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:56:05,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:56:05,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:56:05,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:56:05,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:56:05,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:56:05,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:56:05,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:56:05,216 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:56:05,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:05,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:56:05,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:56:05,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:56:05,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:56:05,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:56:05,218 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 -> b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 [2025-03-08 05:56:05,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:56:05,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:56:05,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:56:05,442 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:56:05,442 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:56:05,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2025-03-08 05:56:06,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f4d978b/64584e78ccce40c8a7708f10b5ac64d4/FLAGd1b022223 [2025-03-08 05:56:06,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:56:06,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2025-03-08 05:56:06,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f4d978b/64584e78ccce40c8a7708f10b5ac64d4/FLAGd1b022223 [2025-03-08 05:56:07,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f4d978b/64584e78ccce40c8a7708f10b5ac64d4 [2025-03-08 05:56:07,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:56:07,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:56:07,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:07,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:56:07,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:56:07,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07, skipping insertion in model container [2025-03-08 05:56:07,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:56:07,365 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2025-03-08 05:56:07,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:07,378 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:56:07,436 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/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2025-03-08 05:56:07,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:56:07,454 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:56:07,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07 WrapperNode [2025-03-08 05:56:07,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:56:07,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:07,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:56:07,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:56:07,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,493 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 508 [2025-03-08 05:56:07,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:56:07,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:56:07,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:56:07,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:56:07,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,528 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 05:56:07,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:56:07,555 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:56:07,556 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:56:07,556 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:56:07,556 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (1/1) ... [2025-03-08 05:56:07,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:56:07,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:07,592 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 05:56:07,599 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 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:56:07,617 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2025-03-08 05:56:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2025-03-08 05:56:07,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:56:07,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:56:08,184 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 05:56:08,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:56:08,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:56:08,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:56:08,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:08 BoogieIcfgContainer [2025-03-08 05:56:08,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:56:08,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:56:08,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:56:08,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:56:08,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:56:07" (1/3) ... [2025-03-08 05:56:08,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68556b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:08, skipping insertion in model container [2025-03-08 05:56:08,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:56:07" (2/3) ... [2025-03-08 05:56:08,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68556b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:56:08, skipping insertion in model container [2025-03-08 05:56:08,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:56:08" (3/3) ... [2025-03-08 05:56:08,208 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2025-03-08 05:56:08,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:56:08,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c that has 7 procedures, 173 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:56:08,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:56:08,275 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;@13d87e26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:56:08,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:56:08,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 136 states have (on average 1.5588235294117647) internal successors, (212), 137 states have internal predecessors, (212), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 05:56:08,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:08,286 INFO L218 NwaCegarLoop]: trace 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] [2025-03-08 05:56:08,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:08,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1646064265, now seen corresponding path program 1 times [2025-03-08 05:56:08,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:08,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43217657] [2025-03-08 05:56:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:08,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 05:56:08,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 05:56:08,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:08,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:08,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:08,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43217657] [2025-03-08 05:56:08,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43217657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:08,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:08,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:56:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481166122] [2025-03-08 05:56:08,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:08,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:56:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:08,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:56:08,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:08,749 INFO L87 Difference]: Start difference. First operand has 173 states, 136 states have (on average 1.5588235294117647) internal successors, (212), 137 states have internal predecessors, (212), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:08,888 INFO L93 Difference]: Finished difference Result 443 states and 752 transitions. [2025-03-08 05:56:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:56:08,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-03-08 05:56:08,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:08,901 INFO L225 Difference]: With dead ends: 443 [2025-03-08 05:56:08,901 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 05:56:08,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:56:08,908 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 134 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:08,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1285 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 05:56:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 170. [2025-03-08 05:56:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 134 states have (on average 1.455223880597015) internal successors, (195), 134 states have internal predecessors, (195), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2025-03-08 05:56:08,943 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 28 [2025-03-08 05:56:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:08,947 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2025-03-08 05:56:08,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2025-03-08 05:56:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 05:56:08,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:08,949 INFO L218 NwaCegarLoop]: trace 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:56:08,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:56:08,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:08,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:08,950 INFO L85 PathProgramCache]: Analyzing trace with hash -481084397, now seen corresponding path program 1 times [2025-03-08 05:56:08,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:08,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-03-08 05:56:08,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:08,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:08,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 05:56:08,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 05:56:08,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:08,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:56:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690313284] [2025-03-08 05:56:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690313284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073140158] [2025-03-08 05:56:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:09,217 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,275 INFO L93 Difference]: Finished difference Result 327 states and 496 transitions. [2025-03-08 05:56:09,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:09,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2025-03-08 05:56:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,278 INFO L225 Difference]: With dead ends: 327 [2025-03-08 05:56:09,279 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 05:56:09,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:56:09,280 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 731 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 05:56:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-08 05:56:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.4452554744525548) internal successors, (198), 137 states have internal predecessors, (198), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 05:56:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 256 transitions. [2025-03-08 05:56:09,301 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 256 transitions. Word has length 39 [2025-03-08 05:56:09,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,301 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 256 transitions. [2025-03-08 05:56:09,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 05:56:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 256 transitions. [2025-03-08 05:56:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:56:09,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:56:09,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2019906233, now seen corresponding path program 1 times [2025-03-08 05:56:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457730307] [2025-03-08 05:56:09,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 05:56:09,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:56:09,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:09,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457730307] [2025-03-08 05:56:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457730307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:09,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918056871] [2025-03-08 05:56:09,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:09,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:09,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,399 INFO L87 Difference]: Start difference. First operand 174 states and 256 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,433 INFO L93 Difference]: Finished difference Result 479 states and 716 transitions. [2025-03-08 05:56:09,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:09,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2025-03-08 05:56:09,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,438 INFO L225 Difference]: With dead ends: 479 [2025-03-08 05:56:09,438 INFO L226 Difference]: Without dead ends: 322 [2025-03-08 05:56:09,439 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 05:56:09,440 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 209 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 502 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-03-08 05:56:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2025-03-08 05:56:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 244 states have (on average 1.4672131147540983) internal successors, (358), 245 states have internal predecessors, (358), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-08 05:56:09,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2025-03-08 05:56:09,469 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 55 [2025-03-08 05:56:09,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,469 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2025-03-08 05:56:09,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,469 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2025-03-08 05:56:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:09,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,471 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:09,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:56:09,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1746684644, now seen corresponding path program 1 times [2025-03-08 05:56:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845472445] [2025-03-08 05:56:09,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:56:09,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:56:09,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:09,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845472445] [2025-03-08 05:56:09,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845472445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:09,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939496609] [2025-03-08 05:56:09,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:09,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:09,559 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,629 INFO L93 Difference]: Finished difference Result 890 states and 1340 transitions. [2025-03-08 05:56:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:09,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-03-08 05:56:09,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,636 INFO L225 Difference]: With dead ends: 890 [2025-03-08 05:56:09,636 INFO L226 Difference]: Without dead ends: 591 [2025-03-08 05:56:09,637 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 05:56:09,638 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 205 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 519 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-08 05:56:09,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 575. [2025-03-08 05:56:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 433 states have (on average 1.4734411085450347) internal successors, (638), 436 states have internal predecessors, (638), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-08 05:56:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 864 transitions. [2025-03-08 05:56:09,682 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 864 transitions. Word has length 56 [2025-03-08 05:56:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 864 transitions. [2025-03-08 05:56:09,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 864 transitions. [2025-03-08 05:56:09,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 05:56:09,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:09,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:56:09,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash -239132835, now seen corresponding path program 1 times [2025-03-08 05:56:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735767504] [2025-03-08 05:56:09,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:09,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 05:56:09,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 05:56:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735767504] [2025-03-08 05:56:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735767504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643268818] [2025-03-08 05:56:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:09,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:09,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:09,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:09,823 INFO L87 Difference]: Start difference. First operand 575 states and 864 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:09,971 INFO L93 Difference]: Finished difference Result 1226 states and 1841 transitions. [2025-03-08 05:56:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:09,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2025-03-08 05:56:09,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:09,978 INFO L225 Difference]: With dead ends: 1226 [2025-03-08 05:56:09,978 INFO L226 Difference]: Without dead ends: 668 [2025-03-08 05:56:09,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 05:56:09,981 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 350 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:09,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 645 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-08 05:56:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 652. [2025-03-08 05:56:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 502 states have (on average 1.4601593625498008) internal successors, (733), 505 states have internal predecessors, (733), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 967 transitions. [2025-03-08 05:56:10,031 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 967 transitions. Word has length 56 [2025-03-08 05:56:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,031 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 967 transitions. [2025-03-08 05:56:10,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 967 transitions. [2025-03-08 05:56:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 05:56:10,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,033 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:56:10,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,033 INFO L85 PathProgramCache]: Analyzing trace with hash -459880236, now seen corresponding path program 1 times [2025-03-08 05:56:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270171717] [2025-03-08 05:56:10,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 05:56:10,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 05:56:10,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270171717] [2025-03-08 05:56:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270171717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:56:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422579478] [2025-03-08 05:56:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:10,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,181 INFO L87 Difference]: Start difference. First operand 652 states and 967 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,317 INFO L93 Difference]: Finished difference Result 1230 states and 1841 transitions. [2025-03-08 05:56:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-03-08 05:56:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,323 INFO L225 Difference]: With dead ends: 1230 [2025-03-08 05:56:10,323 INFO L226 Difference]: Without dead ends: 672 [2025-03-08 05:56:10,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 05:56:10,326 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 350 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 645 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-03-08 05:56:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 660. [2025-03-08 05:56:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 510 states have (on average 1.4529411764705882) internal successors, (741), 513 states have internal predecessors, (741), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 975 transitions. [2025-03-08 05:56:10,369 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 975 transitions. Word has length 57 [2025-03-08 05:56:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,370 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 975 transitions. [2025-03-08 05:56:10,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 975 transitions. [2025-03-08 05:56:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 05:56:10,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:10,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:56:10,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 591144557, now seen corresponding path program 1 times [2025-03-08 05:56:10,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840824730] [2025-03-08 05:56:10,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 05:56:10,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 05:56:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840824730] [2025-03-08 05:56:10,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840824730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177000158] [2025-03-08 05:56:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:10,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:10,521 INFO L87 Difference]: Start difference. First operand 660 states and 975 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,658 INFO L93 Difference]: Finished difference Result 1218 states and 1821 transitions. [2025-03-08 05:56:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2025-03-08 05:56:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,663 INFO L225 Difference]: With dead ends: 1218 [2025-03-08 05:56:10,663 INFO L226 Difference]: Without dead ends: 660 [2025-03-08 05:56:10,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,666 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 52 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 643 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:10,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-08 05:56:10,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-03-08 05:56:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 510 states have (on average 1.4450980392156862) internal successors, (737), 513 states have internal predecessors, (737), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 971 transitions. [2025-03-08 05:56:10,709 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 971 transitions. Word has length 59 [2025-03-08 05:56:10,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:10,710 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 971 transitions. [2025-03-08 05:56:10,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 05:56:10,710 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 971 transitions. [2025-03-08 05:56:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:56:10,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:10,711 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:10,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:56:10,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:10,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:10,712 INFO L85 PathProgramCache]: Analyzing trace with hash -565098732, now seen corresponding path program 1 times [2025-03-08 05:56:10,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:10,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-08 05:56:10,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:10,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:10,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:56:10,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:56:10,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:10,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:10,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612594191] [2025-03-08 05:56:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612594191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741593658] [2025-03-08 05:56:10,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:10,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:10,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:10,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:10,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:10,894 INFO L87 Difference]: Start difference. First operand 660 states and 971 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:56:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:10,954 INFO L93 Difference]: Finished difference Result 1238 states and 1845 transitions. [2025-03-08 05:56:10,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:10,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2025-03-08 05:56:10,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:10,959 INFO L225 Difference]: With dead ends: 1238 [2025-03-08 05:56:10,960 INFO L226 Difference]: Without dead ends: 680 [2025-03-08 05:56:10,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:10,965 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 743 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-08 05:56:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2025-03-08 05:56:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 526 states have (on average 1.4315589353612168) internal successors, (753), 529 states have internal predecessors, (753), 117 states have call successors, (117), 36 states have call predecessors, (117), 36 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 987 transitions. [2025-03-08 05:56:11,008 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 987 transitions. Word has length 60 [2025-03-08 05:56:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,009 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 987 transitions. [2025-03-08 05:56:11,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 05:56:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 987 transitions. [2025-03-08 05:56:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:56:11,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,010 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:56:11,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,011 INFO L85 PathProgramCache]: Analyzing trace with hash 101925366, now seen corresponding path program 1 times [2025-03-08 05:56:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27328621] [2025-03-08 05:56:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:56:11,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:56:11,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27328621] [2025-03-08 05:56:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27328621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479108069] [2025-03-08 05:56:11,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,179 INFO L87 Difference]: Start difference. First operand 680 states and 987 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,243 INFO L93 Difference]: Finished difference Result 1278 states and 1889 transitions. [2025-03-08 05:56:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68 [2025-03-08 05:56:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,248 INFO L225 Difference]: With dead ends: 1278 [2025-03-08 05:56:11,248 INFO L226 Difference]: Without dead ends: 700 [2025-03-08 05:56:11,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:11,250 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 4 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 729 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-08 05:56:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-03-08 05:56:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 542 states have (on average 1.418819188191882) internal successors, (769), 545 states have internal predecessors, (769), 117 states have call successors, (117), 40 states have call predecessors, (117), 40 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1003 transitions. [2025-03-08 05:56:11,283 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1003 transitions. Word has length 68 [2025-03-08 05:56:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,283 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1003 transitions. [2025-03-08 05:56:11,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-08 05:56:11,284 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1003 transitions. [2025-03-08 05:56:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:56:11,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:11,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:56:11,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,285 INFO L85 PathProgramCache]: Analyzing trace with hash 440003868, now seen corresponding path program 1 times [2025-03-08 05:56:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526087196] [2025-03-08 05:56:11,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:56:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:56:11,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526087196] [2025-03-08 05:56:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526087196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585959506] [2025-03-08 05:56:11,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,420 INFO L87 Difference]: Start difference. First operand 700 states and 1003 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,472 INFO L93 Difference]: Finished difference Result 1314 states and 1905 transitions. [2025-03-08 05:56:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-08 05:56:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,477 INFO L225 Difference]: With dead ends: 1314 [2025-03-08 05:56:11,477 INFO L226 Difference]: Without dead ends: 716 [2025-03-08 05:56:11,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:56:11,480 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 739 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-08 05:56:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-08 05:56:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 554 states have (on average 1.4097472924187726) internal successors, (781), 557 states have internal predecessors, (781), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1015 transitions. [2025-03-08 05:56:11,516 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1015 transitions. Word has length 76 [2025-03-08 05:56:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,517 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1015 transitions. [2025-03-08 05:56:11,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1015 transitions. [2025-03-08 05:56:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:56:11,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,520 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:11,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:56:11,521 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash -191924395, now seen corresponding path program 1 times [2025-03-08 05:56:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344107151] [2025-03-08 05:56:11,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:56:11,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:56:11,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:56:11,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344107151] [2025-03-08 05:56:11,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344107151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294490233] [2025-03-08 05:56:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,670 INFO L87 Difference]: Start difference. First operand 716 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,735 INFO L93 Difference]: Finished difference Result 1350 states and 1945 transitions. [2025-03-08 05:56:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-08 05:56:11,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,740 INFO L225 Difference]: With dead ends: 1350 [2025-03-08 05:56:11,740 INFO L226 Difference]: Without dead ends: 736 [2025-03-08 05:56:11,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:11,742 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 4 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 729 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:11,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-08 05:56:11,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2025-03-08 05:56:11,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 570 states have (on average 1.3982456140350876) internal successors, (797), 573 states have internal predecessors, (797), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1031 transitions. [2025-03-08 05:56:11,774 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1031 transitions. Word has length 76 [2025-03-08 05:56:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:11,774 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 1031 transitions. [2025-03-08 05:56:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:56:11,774 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1031 transitions. [2025-03-08 05:56:11,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:56:11,776 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:11,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:11,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:56:11,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:11,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:11,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1169536343, now seen corresponding path program 1 times [2025-03-08 05:56:11,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:11,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392973144] [2025-03-08 05:56:11,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:11,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:11,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:56:11,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:56:11,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:11,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392973144] [2025-03-08 05:56:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392973144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:11,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409457992] [2025-03-08 05:56:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:11,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:11,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:11,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:11,935 INFO L87 Difference]: Start difference. First operand 736 states and 1031 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:56:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:11,991 INFO L93 Difference]: Finished difference Result 1394 states and 1973 transitions. [2025-03-08 05:56:11,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:11,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84 [2025-03-08 05:56:11,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:11,997 INFO L225 Difference]: With dead ends: 1394 [2025-03-08 05:56:11,997 INFO L226 Difference]: Without dead ends: 760 [2025-03-08 05:56:11,999 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 05:56:11,999 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:11,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 741 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-03-08 05:56:12,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2025-03-08 05:56:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 590 states have (on average 1.3847457627118644) internal successors, (817), 593 states have internal predecessors, (817), 117 states have call successors, (117), 52 states have call predecessors, (117), 52 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 05:56:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1051 transitions. [2025-03-08 05:56:12,033 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1051 transitions. Word has length 84 [2025-03-08 05:56:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:12,033 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1051 transitions. [2025-03-08 05:56:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 05:56:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1051 transitions. [2025-03-08 05:56:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:56:12,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:12,036 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:12,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:56:12,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash 284360382, now seen corresponding path program 1 times [2025-03-08 05:56:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125592162] [2025-03-08 05:56:12,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:12,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:56:12,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:56:12,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:12,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:56:12,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:12,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125592162] [2025-03-08 05:56:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125592162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032609594] [2025-03-08 05:56:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:12,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:12,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:12,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:12,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:12,511 INFO L87 Difference]: Start difference. First operand 760 states and 1051 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:56:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:12,754 INFO L93 Difference]: Finished difference Result 1986 states and 2734 transitions. [2025-03-08 05:56:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:12,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87 [2025-03-08 05:56:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:12,762 INFO L225 Difference]: With dead ends: 1986 [2025-03-08 05:56:12,762 INFO L226 Difference]: Without dead ends: 1328 [2025-03-08 05:56:12,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:12,764 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 188 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:12,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1432 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2025-03-08 05:56:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 913. [2025-03-08 05:56:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 706 states have (on average 1.3739376770538243) internal successors, (970), 710 states have internal predecessors, (970), 141 states have call successors, (141), 65 states have call predecessors, (141), 65 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 05:56:12,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1252 transitions. [2025-03-08 05:56:12,836 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1252 transitions. Word has length 87 [2025-03-08 05:56:12,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:12,837 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1252 transitions. [2025-03-08 05:56:12,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:56:12,837 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1252 transitions. [2025-03-08 05:56:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 05:56:12,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:12,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:12,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:56:12,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:12,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -33819426, now seen corresponding path program 1 times [2025-03-08 05:56:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080657484] [2025-03-08 05:56:12,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:12,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:12,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 05:56:12,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 05:56:12,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:12,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:56:12,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:12,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080657484] [2025-03-08 05:56:12,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080657484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:12,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:12,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400372676] [2025-03-08 05:56:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:12,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:12,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:12,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:12,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:12,974 INFO L87 Difference]: Start difference. First operand 913 states and 1252 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:13,036 INFO L93 Difference]: Finished difference Result 1699 states and 2353 transitions. [2025-03-08 05:56:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2025-03-08 05:56:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:13,042 INFO L225 Difference]: With dead ends: 1699 [2025-03-08 05:56:13,042 INFO L226 Difference]: Without dead ends: 933 [2025-03-08 05:56:13,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:56:13,044 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:13,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 739 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-08 05:56:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2025-03-08 05:56:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 721 states have (on average 1.3661581137309293) internal successors, (985), 725 states have internal predecessors, (985), 141 states have call successors, (141), 70 states have call predecessors, (141), 70 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-08 05:56:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1267 transitions. [2025-03-08 05:56:13,088 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1267 transitions. Word has length 91 [2025-03-08 05:56:13,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:13,088 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1267 transitions. [2025-03-08 05:56:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1267 transitions. [2025-03-08 05:56:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:56:13,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:13,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:56:13,090 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1715610085, now seen corresponding path program 1 times [2025-03-08 05:56:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-03-08 05:56:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:13,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:56:13,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:56:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:13,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:13,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121203527] [2025-03-08 05:56:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121203527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:13,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709000506] [2025-03-08 05:56:13,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:13,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:13,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:13,339 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 05:56:13,340 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 05:56:13,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:56:13,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:56:13,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:13,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:13,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 05:56:13,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:56:13,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:13,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709000506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:13,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:13,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-08 05:56:13,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565263100] [2025-03-08 05:56:13,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:13,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:56:13,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:13,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:56:13,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:56:13,572 INFO L87 Difference]: Start difference. First operand 933 states and 1267 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:13,735 INFO L93 Difference]: Finished difference Result 2089 states and 2958 transitions. [2025-03-08 05:56:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:56:13,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2025-03-08 05:56:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:13,743 INFO L225 Difference]: With dead ends: 2089 [2025-03-08 05:56:13,743 INFO L226 Difference]: Without dead ends: 1343 [2025-03-08 05:56:13,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:13,745 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 140 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:13,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 2790 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:13,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2025-03-08 05:56:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 935. [2025-03-08 05:56:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 721 states have (on average 1.3592233009708738) internal successors, (980), 726 states have internal predecessors, (980), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 137 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-08 05:56:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1264 transitions. [2025-03-08 05:56:13,804 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1264 transitions. Word has length 90 [2025-03-08 05:56:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:13,804 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1264 transitions. [2025-03-08 05:56:13,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 05:56:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1264 transitions. [2025-03-08 05:56:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:56:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:13,805 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:13,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:14,006 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,SelfDestructingSolverStorable14 [2025-03-08 05:56:14,006 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:14,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:14,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1388650207, now seen corresponding path program 1 times [2025-03-08 05:56:14,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:14,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576332901] [2025-03-08 05:56:14,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:14,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:14,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:56:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:56:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:56:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576332901] [2025-03-08 05:56:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576332901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:14,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:14,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:14,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993905760] [2025-03-08 05:56:14,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:14,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:14,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:14,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:14,118 INFO L87 Difference]: Start difference. First operand 935 states and 1264 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:56:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:14,249 INFO L93 Difference]: Finished difference Result 1743 states and 2375 transitions. [2025-03-08 05:56:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2025-03-08 05:56:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:14,254 INFO L225 Difference]: With dead ends: 1743 [2025-03-08 05:56:14,254 INFO L226 Difference]: Without dead ends: 996 [2025-03-08 05:56:14,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:14,256 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 237 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:14,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1441 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2025-03-08 05:56:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 954. [2025-03-08 05:56:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 745 states have (on average 1.3557046979865772) internal successors, (1010), 754 states have internal predecessors, (1010), 136 states have call successors, (136), 72 states have call predecessors, (136), 72 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 05:56:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1282 transitions. [2025-03-08 05:56:14,312 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1282 transitions. Word has length 93 [2025-03-08 05:56:14,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:14,312 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1282 transitions. [2025-03-08 05:56:14,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:56:14,313 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1282 transitions. [2025-03-08 05:56:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:56:14,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:14,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:14,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:56:14,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -149978937, now seen corresponding path program 1 times [2025-03-08 05:56:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:14,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250120528] [2025-03-08 05:56:14,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:14,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:14,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:56:14,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:56:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 05:56:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250120528] [2025-03-08 05:56:14,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250120528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:14,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:14,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073798748] [2025-03-08 05:56:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:14,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:14,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:14,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:14,663 INFO L87 Difference]: Start difference. First operand 954 states and 1282 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:14,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:14,843 INFO L93 Difference]: Finished difference Result 1729 states and 2338 transitions. [2025-03-08 05:56:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:14,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95 [2025-03-08 05:56:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:14,849 INFO L225 Difference]: With dead ends: 1729 [2025-03-08 05:56:14,849 INFO L226 Difference]: Without dead ends: 953 [2025-03-08 05:56:14,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:14,851 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 132 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:14,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1517 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:14,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-08 05:56:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 943. [2025-03-08 05:56:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 737 states have (on average 1.3541383989145184) internal successors, (998), 746 states have internal predecessors, (998), 134 states have call successors, (134), 71 states have call predecessors, (134), 71 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 05:56:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1266 transitions. [2025-03-08 05:56:14,898 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1266 transitions. Word has length 95 [2025-03-08 05:56:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:14,899 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1266 transitions. [2025-03-08 05:56:14,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1266 transitions. [2025-03-08 05:56:14,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:56:14,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:14,900 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:56:14,900 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1102196850, now seen corresponding path program 1 times [2025-03-08 05:56:14,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:14,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671396517] [2025-03-08 05:56:14,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:14,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:56:14,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:56:14,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:15,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671396517] [2025-03-08 05:56:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671396517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:15,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:15,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188997122] [2025-03-08 05:56:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:15,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:15,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:15,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:15,298 INFO L87 Difference]: Start difference. First operand 943 states and 1266 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:15,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:15,698 INFO L93 Difference]: Finished difference Result 1798 states and 2400 transitions. [2025-03-08 05:56:15,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:15,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2025-03-08 05:56:15,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:15,707 INFO L225 Difference]: With dead ends: 1798 [2025-03-08 05:56:15,707 INFO L226 Difference]: Without dead ends: 1002 [2025-03-08 05:56:15,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:15,710 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 510 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:15,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1194 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:56:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-03-08 05:56:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 959. [2025-03-08 05:56:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 745 states have (on average 1.3302013422818793) internal successors, (991), 755 states have internal predecessors, (991), 137 states have call successors, (137), 76 states have call predecessors, (137), 76 states have return successors, (137), 127 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 05:56:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1265 transitions. [2025-03-08 05:56:15,789 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1265 transitions. Word has length 96 [2025-03-08 05:56:15,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1265 transitions. [2025-03-08 05:56:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:56:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1265 transitions. [2025-03-08 05:56:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:56:15,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:15,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:56:15,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:15,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 678665961, now seen corresponding path program 1 times [2025-03-08 05:56:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645019736] [2025-03-08 05:56:15,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:15,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:56:15,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:56:15,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:15,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:15,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645019736] [2025-03-08 05:56:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645019736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:15,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:15,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:15,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094042552] [2025-03-08 05:56:15,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:15,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:15,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:15,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:15,867 INFO L87 Difference]: Start difference. First operand 959 states and 1265 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,005 INFO L93 Difference]: Finished difference Result 2534 states and 3361 transitions. [2025-03-08 05:56:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2025-03-08 05:56:16,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,013 INFO L225 Difference]: With dead ends: 2534 [2025-03-08 05:56:16,014 INFO L226 Difference]: Without dead ends: 1773 [2025-03-08 05:56:16,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:16,017 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 193 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1127 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2025-03-08 05:56:16,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1540. [2025-03-08 05:56:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 1183 states have (on average 1.323753169907016) internal successors, (1566), 1199 states have internal predecessors, (1566), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-08 05:56:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2028 transitions. [2025-03-08 05:56:16,140 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2028 transitions. Word has length 97 [2025-03-08 05:56:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 1540 states and 2028 transitions. [2025-03-08 05:56:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2028 transitions. [2025-03-08 05:56:16,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:16,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:16,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:56:16,143 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash -214280116, now seen corresponding path program 1 times [2025-03-08 05:56:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:16,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958255043] [2025-03-08 05:56:16,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:16,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:16,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:16,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:16,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958255043] [2025-03-08 05:56:16,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958255043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:16,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:16,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:16,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206272047] [2025-03-08 05:56:16,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:16,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:16,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:16,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:16,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:16,226 INFO L87 Difference]: Start difference. First operand 1540 states and 2028 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,400 INFO L93 Difference]: Finished difference Result 3612 states and 4780 transitions. [2025-03-08 05:56:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:16,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,412 INFO L225 Difference]: With dead ends: 3612 [2025-03-08 05:56:16,412 INFO L226 Difference]: Without dead ends: 2353 [2025-03-08 05:56:16,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:16,417 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 194 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1161 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2025-03-08 05:56:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2118. [2025-03-08 05:56:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 1618 states have (on average 1.3176761433868973) internal successors, (2132), 1640 states have internal predecessors, (2132), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-08 05:56:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2782 transitions. [2025-03-08 05:56:16,575 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2782 transitions. Word has length 99 [2025-03-08 05:56:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:16,576 INFO L471 AbstractCegarLoop]: Abstraction has 2118 states and 2782 transitions. [2025-03-08 05:56:16,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2782 transitions. [2025-03-08 05:56:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:16,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:16,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:16,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:56:16,578 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:16,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:16,578 INFO L85 PathProgramCache]: Analyzing trace with hash -446722704, now seen corresponding path program 1 times [2025-03-08 05:56:16,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:16,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733897841] [2025-03-08 05:56:16,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:16,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:16,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:16,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:16,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733897841] [2025-03-08 05:56:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733897841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:16,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:56:16,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435396081] [2025-03-08 05:56:16,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:16,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:56:16,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:16,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:56:16,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:56:16,626 INFO L87 Difference]: Start difference. First operand 2118 states and 2782 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:16,762 INFO L93 Difference]: Finished difference Result 4008 states and 5291 transitions. [2025-03-08 05:56:16,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:56:16,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:16,772 INFO L225 Difference]: With dead ends: 4008 [2025-03-08 05:56:16,773 INFO L226 Difference]: Without dead ends: 2127 [2025-03-08 05:56:16,777 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 05:56:16,778 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:16,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 468 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-03-08 05:56:16,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2121. [2025-03-08 05:56:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1621 states have (on average 1.3170882171499074) internal successors, (2135), 1643 states have internal predecessors, (2135), 325 states have call successors, (325), 174 states have call predecessors, (325), 174 states have return successors, (325), 303 states have call predecessors, (325), 325 states have call successors, (325) [2025-03-08 05:56:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2785 transitions. [2025-03-08 05:56:16,913 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2785 transitions. Word has length 99 [2025-03-08 05:56:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:16,913 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2785 transitions. [2025-03-08 05:56:16,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2785 transitions. [2025-03-08 05:56:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:56:16,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:16,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:16,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:56:16,915 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:16,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2077822546, now seen corresponding path program 1 times [2025-03-08 05:56:16,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:16,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829723449] [2025-03-08 05:56:16,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:16,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:16,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:56:16,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:56:16,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:16,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:56:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829723449] [2025-03-08 05:56:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829723449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:17,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:17,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519693345] [2025-03-08 05:56:17,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:17,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:17,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:17,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:17,289 INFO L87 Difference]: Start difference. First operand 2121 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:17,810 INFO L93 Difference]: Finished difference Result 4401 states and 5775 transitions. [2025-03-08 05:56:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:56:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-08 05:56:17,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:17,834 INFO L225 Difference]: With dead ends: 4401 [2025-03-08 05:56:17,835 INFO L226 Difference]: Without dead ends: 2653 [2025-03-08 05:56:17,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:17,844 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 504 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:17,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1311 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:56:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2025-03-08 05:56:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 2128. [2025-03-08 05:56:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 1617 states have (on average 1.3153988868274582) internal successors, (2127), 1640 states have internal predecessors, (2127), 332 states have call successors, (332), 178 states have call predecessors, (332), 178 states have return successors, (332), 309 states have call predecessors, (332), 332 states have call successors, (332) [2025-03-08 05:56:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2791 transitions. [2025-03-08 05:56:18,036 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2791 transitions. Word has length 99 [2025-03-08 05:56:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 2791 transitions. [2025-03-08 05:56:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2791 transitions. [2025-03-08 05:56:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:56:18,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:18,038 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:56:18,039 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:18,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -462060689, now seen corresponding path program 1 times [2025-03-08 05:56:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856780423] [2025-03-08 05:56:18,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:18,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:56:18,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:56:18,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:18,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:18,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:18,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856780423] [2025-03-08 05:56:18,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856780423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:18,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:18,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:18,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434646293] [2025-03-08 05:56:18,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:18,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:18,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:18,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:18,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:18,113 INFO L87 Difference]: Start difference. First operand 2128 states and 2791 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:18,359 INFO L93 Difference]: Finished difference Result 5321 states and 7014 transitions. [2025-03-08 05:56:18,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:18,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 101 [2025-03-08 05:56:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:18,376 INFO L225 Difference]: With dead ends: 5321 [2025-03-08 05:56:18,376 INFO L226 Difference]: Without dead ends: 3611 [2025-03-08 05:56:18,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:56:18,385 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 198 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:18,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1147 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2025-03-08 05:56:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3378. [2025-03-08 05:56:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 2532 states have (on average 1.3025276461295419) internal successors, (3298), 2569 states have internal predecessors, (3298), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2025-03-08 05:56:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4400 transitions. [2025-03-08 05:56:18,612 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4400 transitions. Word has length 101 [2025-03-08 05:56:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4400 transitions. [2025-03-08 05:56:18,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4400 transitions. [2025-03-08 05:56:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:56:18,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:18,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:18,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:56:18,615 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1989907828, now seen corresponding path program 1 times [2025-03-08 05:56:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489843095] [2025-03-08 05:56:18,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:18,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:56:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:56:18,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:18,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:18,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:18,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489843095] [2025-03-08 05:56:18,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489843095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:18,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:18,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:18,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943287924] [2025-03-08 05:56:18,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:18,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:18,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:18,727 INFO L87 Difference]: Start difference. First operand 3378 states and 4400 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:18,915 INFO L93 Difference]: Finished difference Result 6408 states and 8368 transitions. [2025-03-08 05:56:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 102 [2025-03-08 05:56:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:18,931 INFO L225 Difference]: With dead ends: 6408 [2025-03-08 05:56:18,931 INFO L226 Difference]: Without dead ends: 3102 [2025-03-08 05:56:18,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:56:18,939 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 74 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:18,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 728 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-03-08 05:56:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 2997. [2025-03-08 05:56:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2997 states, 2228 states have (on average 1.3065529622980252) internal successors, (2911), 2252 states have internal predecessors, (2911), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2025-03-08 05:56:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3915 transitions. [2025-03-08 05:56:19,161 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3915 transitions. Word has length 102 [2025-03-08 05:56:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:19,161 INFO L471 AbstractCegarLoop]: Abstraction has 2997 states and 3915 transitions. [2025-03-08 05:56:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3915 transitions. [2025-03-08 05:56:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:56:19,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:19,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:56:19,163 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:19,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1137830484, now seen corresponding path program 1 times [2025-03-08 05:56:19,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:19,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632942766] [2025-03-08 05:56:19,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:19,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:56:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:56:19,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:19,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:56:19,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632942766] [2025-03-08 05:56:19,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632942766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:19,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:19,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:56:19,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639092766] [2025-03-08 05:56:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:19,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:56:19,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:19,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:56:19,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:56:19,268 INFO L87 Difference]: Start difference. First operand 2997 states and 3915 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:19,445 INFO L93 Difference]: Finished difference Result 5790 states and 7586 transitions. [2025-03-08 05:56:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:56:19,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 104 [2025-03-08 05:56:19,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:19,462 INFO L225 Difference]: With dead ends: 5790 [2025-03-08 05:56:19,463 INFO L226 Difference]: Without dead ends: 2912 [2025-03-08 05:56:19,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 05:56:19,470 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 60 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:19,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 720 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2025-03-08 05:56:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2757. [2025-03-08 05:56:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2757 states, 2047 states have (on average 1.305324865657059) internal successors, (2672), 2066 states have internal predecessors, (2672), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2025-03-08 05:56:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3600 transitions. [2025-03-08 05:56:19,765 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3600 transitions. Word has length 104 [2025-03-08 05:56:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:19,766 INFO L471 AbstractCegarLoop]: Abstraction has 2757 states and 3600 transitions. [2025-03-08 05:56:19,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:56:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3600 transitions. [2025-03-08 05:56:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 05:56:19,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:19,771 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:56:19,772 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1249306862, now seen corresponding path program 1 times [2025-03-08 05:56:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050015977] [2025-03-08 05:56:19,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:19,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:19,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 05:56:19,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 05:56:19,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:19,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050015977] [2025-03-08 05:56:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050015977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977964358] [2025-03-08 05:56:20,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:20,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:20,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:20,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:56:20,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 05:56:20,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 05:56:20,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:20,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:20,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 05:56:20,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:56:20,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:56:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977964358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:20,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:56:20,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:56:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906632084] [2025-03-08 05:56:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:20,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:56:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:20,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:56:20,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:20,669 INFO L87 Difference]: Start difference. First operand 2757 states and 3600 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:56:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:20,834 INFO L93 Difference]: Finished difference Result 5184 states and 6811 transitions. [2025-03-08 05:56:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:56:20,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2025-03-08 05:56:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:20,845 INFO L225 Difference]: With dead ends: 5184 [2025-03-08 05:56:20,845 INFO L226 Difference]: Without dead ends: 2586 [2025-03-08 05:56:20,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:20,852 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:20,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 988 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:56:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2025-03-08 05:56:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2570. [2025-03-08 05:56:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 1905 states have (on average 1.3018372703412073) internal successors, (2480), 1922 states have internal predecessors, (2480), 435 states have call successors, (435), 229 states have call predecessors, (435), 229 states have return successors, (435), 418 states have call predecessors, (435), 435 states have call successors, (435) [2025-03-08 05:56:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3350 transitions. [2025-03-08 05:56:21,014 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3350 transitions. Word has length 154 [2025-03-08 05:56:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:21,015 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 3350 transitions. [2025-03-08 05:56:21,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-08 05:56:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3350 transitions. [2025-03-08 05:56:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-08 05:56:21,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:21,019 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:21,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:21,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 05:56:21,221 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:21,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:21,222 INFO L85 PathProgramCache]: Analyzing trace with hash -636358220, now seen corresponding path program 1 times [2025-03-08 05:56:21,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:21,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905987437] [2025-03-08 05:56:21,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:21,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:56:21,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:56:21,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:21,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:21,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905987437] [2025-03-08 05:56:21,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905987437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:21,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361505873] [2025-03-08 05:56:21,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:21,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:21,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:21,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:21,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:56:21,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-08 05:56:21,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-08 05:56:21,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:21,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:21,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 05:56:22,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:22,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:22,554 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361505873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:22,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2025-03-08 05:56:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105490351] [2025-03-08 05:56:22,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:22,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:56:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:22,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:56:22,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:56:22,557 INFO L87 Difference]: Start difference. First operand 2570 states and 3350 transitions. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 20 states have internal predecessors, (240), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2025-03-08 05:56:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:23,979 INFO L93 Difference]: Finished difference Result 7230 states and 9467 transitions. [2025-03-08 05:56:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 05:56:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 20 states have internal predecessors, (240), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) Word has length 156 [2025-03-08 05:56:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:23,999 INFO L225 Difference]: With dead ends: 7230 [2025-03-08 05:56:23,999 INFO L226 Difference]: Without dead ends: 4902 [2025-03-08 05:56:24,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 05:56:24,009 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1886 mSDsluCounter, 2993 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:24,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 3389 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 05:56:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-03-08 05:56:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4394. [2025-03-08 05:56:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4394 states, 3258 states have (on average 1.306936771025169) internal successors, (4258), 3286 states have internal predecessors, (4258), 741 states have call successors, (741), 394 states have call predecessors, (741), 394 states have return successors, (741), 713 states have call predecessors, (741), 741 states have call successors, (741) [2025-03-08 05:56:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4394 states to 4394 states and 5740 transitions. [2025-03-08 05:56:24,311 INFO L78 Accepts]: Start accepts. Automaton has 4394 states and 5740 transitions. Word has length 156 [2025-03-08 05:56:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:24,311 INFO L471 AbstractCegarLoop]: Abstraction has 4394 states and 5740 transitions. [2025-03-08 05:56:24,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 20 states have internal predecessors, (240), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2025-03-08 05:56:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4394 states and 5740 transitions. [2025-03-08 05:56:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:56:24,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:24,318 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:24,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:24,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:24,522 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:24,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1118649711, now seen corresponding path program 1 times [2025-03-08 05:56:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796097692] [2025-03-08 05:56:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:56:24,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:56:24,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:24,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-03-08 05:56:25,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796097692] [2025-03-08 05:56:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796097692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480072557] [2025-03-08 05:56:25,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:25,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:25,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:25,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:56:25,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:56:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:56:25,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:25,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:25,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 05:56:25,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:25,768 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:56:25,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-08 05:56:26,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480072557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:26,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 26 [2025-03-08 05:56:26,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001823045] [2025-03-08 05:56:26,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:26,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:56:26,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:26,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:56:26,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:56:26,310 INFO L87 Difference]: Start difference. First operand 4394 states and 5740 transitions. Second operand has 26 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-08 05:56:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:29,596 INFO L93 Difference]: Finished difference Result 13955 states and 18095 transitions. [2025-03-08 05:56:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-08 05:56:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) Word has length 157 [2025-03-08 05:56:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:29,629 INFO L225 Difference]: With dead ends: 13955 [2025-03-08 05:56:29,629 INFO L226 Difference]: Without dead ends: 9796 [2025-03-08 05:56:29,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2272 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1371, Invalid=6111, Unknown=0, NotChecked=0, Total=7482 [2025-03-08 05:56:29,639 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 2162 mSDsluCounter, 3439 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 3748 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:29,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 3748 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:56:29,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9796 states. [2025-03-08 05:56:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9796 to 6838. [2025-03-08 05:56:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6838 states, 5040 states have (on average 1.2976190476190477) internal successors, (6540), 5089 states have internal predecessors, (6540), 1156 states have call successors, (1156), 641 states have call predecessors, (1156), 641 states have return successors, (1156), 1107 states have call predecessors, (1156), 1156 states have call successors, (1156) [2025-03-08 05:56:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 8852 transitions. [2025-03-08 05:56:30,413 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 8852 transitions. Word has length 157 [2025-03-08 05:56:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:30,414 INFO L471 AbstractCegarLoop]: Abstraction has 6838 states and 8852 transitions. [2025-03-08 05:56:30,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 10.0) internal successors, (250), 24 states have internal predecessors, (250), 9 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2025-03-08 05:56:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 8852 transitions. [2025-03-08 05:56:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:56:30,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:30,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:30,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 05:56:30,624 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1076344635, now seen corresponding path program 1 times [2025-03-08 05:56:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657028664] [2025-03-08 05:56:30,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:30,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:56:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:56:30,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 05:56:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657028664] [2025-03-08 05:56:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657028664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:56:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:56:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:56:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789412859] [2025-03-08 05:56:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:56:30,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:56:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:30,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:56:30,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:56:30,751 INFO L87 Difference]: Start difference. First operand 6838 states and 8852 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:56:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:31,893 INFO L93 Difference]: Finished difference Result 20112 states and 26114 transitions. [2025-03-08 05:56:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:56:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 167 [2025-03-08 05:56:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:31,943 INFO L225 Difference]: With dead ends: 20112 [2025-03-08 05:56:31,944 INFO L226 Difference]: Without dead ends: 13593 [2025-03-08 05:56:31,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:56:31,957 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 215 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:31,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2484 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:56:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13593 states. [2025-03-08 05:56:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13593 to 9322. [2025-03-08 05:56:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9322 states, 6828 states have (on average 1.2956942003514937) internal successors, (8847), 6895 states have internal predecessors, (8847), 1620 states have call successors, (1620), 873 states have call predecessors, (1620), 873 states have return successors, (1620), 1553 states have call predecessors, (1620), 1620 states have call successors, (1620) [2025-03-08 05:56:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9322 states to 9322 states and 12087 transitions. [2025-03-08 05:56:33,209 INFO L78 Accepts]: Start accepts. Automaton has 9322 states and 12087 transitions. Word has length 167 [2025-03-08 05:56:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:33,210 INFO L471 AbstractCegarLoop]: Abstraction has 9322 states and 12087 transitions. [2025-03-08 05:56:33,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:56:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9322 states and 12087 transitions. [2025-03-08 05:56:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 05:56:33,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:33,222 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 05:56:33,222 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -299241832, now seen corresponding path program 1 times [2025-03-08 05:56:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973994059] [2025-03-08 05:56:33,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:56:33,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:56:33,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:33,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-08 05:56:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973994059] [2025-03-08 05:56:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973994059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29905783] [2025-03-08 05:56:34,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:34,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:34,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:34,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:56:34,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 05:56:34,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 05:56:34,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:34,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:34,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 05:56:34,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:56:34,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:34,490 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-08 05:56:34,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29905783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:34,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:34,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2025-03-08 05:56:34,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210116144] [2025-03-08 05:56:34,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:34,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 05:56:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:34,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 05:56:34,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:56:34,492 INFO L87 Difference]: Start difference. First operand 9322 states and 12087 transitions. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 15 states have internal predecessors, (203), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-08 05:56:36,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:36,525 INFO L93 Difference]: Finished difference Result 19395 states and 25139 transitions. [2025-03-08 05:56:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 05:56:36,526 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 15 states have internal predecessors, (203), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 167 [2025-03-08 05:56:36,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:36,568 INFO L225 Difference]: With dead ends: 19395 [2025-03-08 05:56:36,568 INFO L226 Difference]: Without dead ends: 10287 [2025-03-08 05:56:36,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1628, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 05:56:36,584 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 827 mSDsluCounter, 4134 mSDsCounter, 0 mSdLazyCounter, 1601 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:36,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 4585 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:56:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2025-03-08 05:56:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 9798. [2025-03-08 05:56:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9798 states, 7182 states have (on average 1.2946254525201895) internal successors, (9298), 7253 states have internal predecessors, (9298), 1699 states have call successors, (1699), 916 states have call predecessors, (1699), 916 states have return successors, (1699), 1628 states have call predecessors, (1699), 1699 states have call successors, (1699) [2025-03-08 05:56:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9798 states to 9798 states and 12696 transitions. [2025-03-08 05:56:37,569 INFO L78 Accepts]: Start accepts. Automaton has 9798 states and 12696 transitions. Word has length 167 [2025-03-08 05:56:37,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:37,569 INFO L471 AbstractCegarLoop]: Abstraction has 9798 states and 12696 transitions. [2025-03-08 05:56:37,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 15 states have internal predecessors, (203), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-08 05:56:37,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9798 states and 12696 transitions. [2025-03-08 05:56:37,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 05:56:37,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:37,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:37,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:56:37,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:37,779 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2119619936, now seen corresponding path program 1 times [2025-03-08 05:56:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236581233] [2025-03-08 05:56:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:37,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:56:37,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:56:37,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236581233] [2025-03-08 05:56:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236581233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26207833] [2025-03-08 05:56:38,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:38,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:38,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:38,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:38,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:56:38,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 05:56:38,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 05:56:38,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:38,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 05:56:38,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 76 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:56:38,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:39,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26207833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:39,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:39,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 18 [2025-03-08 05:56:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185487879] [2025-03-08 05:56:39,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:39,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:56:39,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:39,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:56:39,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:56:39,199 INFO L87 Difference]: Start difference. First operand 9798 states and 12696 transitions. Second operand has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 05:56:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:41,570 INFO L93 Difference]: Finished difference Result 24185 states and 31448 transitions. [2025-03-08 05:56:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 05:56:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) Word has length 176 [2025-03-08 05:56:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:41,626 INFO L225 Difference]: With dead ends: 24185 [2025-03-08 05:56:41,626 INFO L226 Difference]: Without dead ends: 14706 [2025-03-08 05:56:41,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=879, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 05:56:41,646 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 1296 mSDsluCounter, 1926 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:41,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 2277 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:56:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14706 states. [2025-03-08 05:56:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14706 to 13854. [2025-03-08 05:56:43,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 10131 states have (on average 1.2979962491363142) internal successors, (13150), 10236 states have internal predecessors, (13150), 2418 states have call successors, (2418), 1304 states have call predecessors, (2418), 1304 states have return successors, (2418), 2313 states have call predecessors, (2418), 2418 states have call successors, (2418) [2025-03-08 05:56:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 17986 transitions. [2025-03-08 05:56:43,444 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 17986 transitions. Word has length 176 [2025-03-08 05:56:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:43,444 INFO L471 AbstractCegarLoop]: Abstraction has 13854 states and 17986 transitions. [2025-03-08 05:56:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 7 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (33), 7 states have call predecessors, (33), 7 states have call successors, (33) [2025-03-08 05:56:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 17986 transitions. [2025-03-08 05:56:43,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:56:43,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:43,454 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:43,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:56:43,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:43,655 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:43,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -849150538, now seen corresponding path program 1 times [2025-03-08 05:56:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329525105] [2025-03-08 05:56:43,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:43,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:43,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:56:43,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:56:43,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:43,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:44,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329525105] [2025-03-08 05:56:44,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329525105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:44,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714417553] [2025-03-08 05:56:44,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:44,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:44,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:56:44,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:56:44,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:56:44,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:44,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:44,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 05:56:44,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:56:44,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:45,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714417553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:45,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:45,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 21 [2025-03-08 05:56:45,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448123484] [2025-03-08 05:56:45,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:45,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:56:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:45,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:56:45,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:56:45,024 INFO L87 Difference]: Start difference. First operand 13854 states and 17986 transitions. Second operand has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 05:56:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:48,507 INFO L93 Difference]: Finished difference Result 33584 states and 43741 transitions. [2025-03-08 05:56:48,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 05:56:48,508 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) Word has length 177 [2025-03-08 05:56:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:48,588 INFO L225 Difference]: With dead ends: 33584 [2025-03-08 05:56:48,589 INFO L226 Difference]: Without dead ends: 20949 [2025-03-08 05:56:48,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=497, Invalid=1953, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 05:56:48,617 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 1193 mSDsluCounter, 3122 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 2338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:48,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 3467 Invalid, 2338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 05:56:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20949 states. [2025-03-08 05:56:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20949 to 20380. [2025-03-08 05:56:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20380 states, 14949 states have (on average 1.2998862800187303) internal successors, (19432), 15101 states have internal predecessors, (19432), 3519 states have call successors, (3519), 1911 states have call predecessors, (3519), 1911 states have return successors, (3519), 3367 states have call predecessors, (3519), 3519 states have call successors, (3519) [2025-03-08 05:56:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20380 states to 20380 states and 26470 transitions. [2025-03-08 05:56:51,073 INFO L78 Accepts]: Start accepts. Automaton has 20380 states and 26470 transitions. Word has length 177 [2025-03-08 05:56:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:56:51,074 INFO L471 AbstractCegarLoop]: Abstraction has 20380 states and 26470 transitions. [2025-03-08 05:56:51,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.095238095238095) internal successors, (254), 20 states have internal predecessors, (254), 8 states have call successors, (34), 5 states have call predecessors, (34), 6 states have return successors, (34), 9 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-08 05:56:51,074 INFO L276 IsEmpty]: Start isEmpty. Operand 20380 states and 26470 transitions. [2025-03-08 05:56:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 05:56:51,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:56:51,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:51,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:56:51,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:51,285 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:56:51,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:56:51,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1385193178, now seen corresponding path program 1 times [2025-03-08 05:56:51,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:56:51,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310497868] [2025-03-08 05:56:51,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:51,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:56:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:56:51,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:56:51,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:51,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:51,797 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-08 05:56:51,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:56:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310497868] [2025-03-08 05:56:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310497868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:56:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933836735] [2025-03-08 05:56:51,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:56:51,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:56:51,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:56:51,800 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:56:51,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:56:51,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 05:56:51,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 05:56:51,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:56:51,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:56:51,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 05:56:51,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:56:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:56:52,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:56:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 05:56:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933836735] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:56:52,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:56:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 27 [2025-03-08 05:56:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471916134] [2025-03-08 05:56:52,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:56:52,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 05:56:52,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:56:52,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 05:56:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:56:52,466 INFO L87 Difference]: Start difference. First operand 20380 states and 26470 transitions. Second operand has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 23 states have internal predecessors, (235), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 05:56:59,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:56:59,556 INFO L93 Difference]: Finished difference Result 56120 states and 74645 transitions. [2025-03-08 05:56:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 05:56:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 23 states have internal predecessors, (235), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) Word has length 177 [2025-03-08 05:56:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:56:59,678 INFO L225 Difference]: With dead ends: 56120 [2025-03-08 05:56:59,678 INFO L226 Difference]: Without dead ends: 35802 [2025-03-08 05:56:59,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=573, Invalid=3333, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 05:56:59,717 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1689 mSDsluCounter, 7035 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 7566 SdHoareTripleChecker+Invalid, 3342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:56:59,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 7566 Invalid, 3342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:56:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35802 states. [2025-03-08 05:57:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35802 to 23836. [2025-03-08 05:57:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23836 states, 17433 states have (on average 1.2966213503126254) internal successors, (22604), 17621 states have internal predecessors, (22604), 4143 states have call successors, (4143), 2259 states have call predecessors, (4143), 2259 states have return successors, (4143), 3955 states have call predecessors, (4143), 4143 states have call successors, (4143) [2025-03-08 05:57:03,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23836 states to 23836 states and 30890 transitions. [2025-03-08 05:57:03,042 INFO L78 Accepts]: Start accepts. Automaton has 23836 states and 30890 transitions. Word has length 177 [2025-03-08 05:57:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:03,042 INFO L471 AbstractCegarLoop]: Abstraction has 23836 states and 30890 transitions. [2025-03-08 05:57:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.703703703703704) internal successors, (235), 23 states have internal predecessors, (235), 7 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (40), 11 states have call predecessors, (40), 7 states have call successors, (40) [2025-03-08 05:57:03,042 INFO L276 IsEmpty]: Start isEmpty. Operand 23836 states and 30890 transitions. [2025-03-08 05:57:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:57:03,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:03,051 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:03,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:57:03,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-08 05:57:03,251 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:03,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:03,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1532624063, now seen corresponding path program 1 times [2025-03-08 05:57:03,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:03,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913906634] [2025-03-08 05:57:03,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:03,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:03,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:57:03,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:57:03,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:03,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:03,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:03,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913906634] [2025-03-08 05:57:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913906634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:03,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506231115] [2025-03-08 05:57:03,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:03,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:03,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:03,590 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:03,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 05:57:03,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:57:03,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:57:03,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:03,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:03,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 05:57:03,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 77 proven. 13 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:57:04,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:04,404 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506231115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:04,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 20 [2025-03-08 05:57:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853920340] [2025-03-08 05:57:04,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:57:04,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:04,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:57:04,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:57:04,406 INFO L87 Difference]: Start difference. First operand 23836 states and 30890 transitions. Second operand has 20 states, 20 states have (on average 12.1) internal successors, (242), 19 states have internal predecessors, (242), 7 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-08 05:57:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:08,688 INFO L93 Difference]: Finished difference Result 50265 states and 65243 transitions. [2025-03-08 05:57:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:57:08,689 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.1) internal successors, (242), 19 states have internal predecessors, (242), 7 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 7 states have call successors, (36) Word has length 184 [2025-03-08 05:57:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:08,792 INFO L225 Difference]: With dead ends: 50265 [2025-03-08 05:57:08,792 INFO L226 Difference]: Without dead ends: 27989 [2025-03-08 05:57:08,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 05:57:08,830 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 1253 mSDsluCounter, 2721 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 3065 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:08,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 3065 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 05:57:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27989 states. [2025-03-08 05:57:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27989 to 27875. [2025-03-08 05:57:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27875 states, 20375 states have (on average 1.2958527607361963) internal successors, (26403), 20596 states have internal predecessors, (26403), 4854 states have call successors, (4854), 2645 states have call predecessors, (4854), 2645 states have return successors, (4854), 4633 states have call predecessors, (4854), 4854 states have call successors, (4854) [2025-03-08 05:57:12,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27875 states to 27875 states and 36111 transitions. [2025-03-08 05:57:12,986 INFO L78 Accepts]: Start accepts. Automaton has 27875 states and 36111 transitions. Word has length 184 [2025-03-08 05:57:12,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:12,986 INFO L471 AbstractCegarLoop]: Abstraction has 27875 states and 36111 transitions. [2025-03-08 05:57:12,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.1) internal successors, (242), 19 states have internal predecessors, (242), 7 states have call successors, (36), 5 states have call predecessors, (36), 6 states have return successors, (36), 8 states have call predecessors, (36), 7 states have call successors, (36) [2025-03-08 05:57:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 27875 states and 36111 transitions. [2025-03-08 05:57:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:57:12,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:12,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:13,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 05:57:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:13,196 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:13,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -590302285, now seen corresponding path program 1 times [2025-03-08 05:57:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098377748] [2025-03-08 05:57:13,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:57:13,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:57:13,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 05:57:13,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098377748] [2025-03-08 05:57:13,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098377748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517239136] [2025-03-08 05:57:13,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:13,674 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:13,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 05:57:13,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:57:13,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:57:13,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:13,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:13,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 05:57:13,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:57:14,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-08 05:57:14,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517239136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:14,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 20 [2025-03-08 05:57:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529305268] [2025-03-08 05:57:14,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:57:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:14,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:57:14,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:57:14,150 INFO L87 Difference]: Start difference. First operand 27875 states and 36111 transitions. Second operand has 20 states, 20 states have (on average 11.3) internal successors, (226), 17 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-08 05:57:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:57:17,750 INFO L93 Difference]: Finished difference Result 50297 states and 65095 transitions. [2025-03-08 05:57:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:57:17,750 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.3) internal successors, (226), 17 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2025-03-08 05:57:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:57:17,849 INFO L225 Difference]: With dead ends: 50297 [2025-03-08 05:57:17,849 INFO L226 Difference]: Without dead ends: 22645 [2025-03-08 05:57:17,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2025-03-08 05:57:17,891 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 982 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:57:17,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 2135 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:57:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22645 states. [2025-03-08 05:57:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22645 to 22233. [2025-03-08 05:57:21,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22233 states, 16346 states have (on average 1.2916921571026552) internal successors, (21114), 16522 states have internal predecessors, (21114), 3797 states have call successors, (3797), 2089 states have call predecessors, (3797), 2089 states have return successors, (3797), 3621 states have call predecessors, (3797), 3797 states have call successors, (3797) [2025-03-08 05:57:21,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22233 states to 22233 states and 28708 transitions. [2025-03-08 05:57:21,349 INFO L78 Accepts]: Start accepts. Automaton has 22233 states and 28708 transitions. Word has length 184 [2025-03-08 05:57:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:57:21,350 INFO L471 AbstractCegarLoop]: Abstraction has 22233 states and 28708 transitions. [2025-03-08 05:57:21,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.3) internal successors, (226), 17 states have internal predecessors, (226), 6 states have call successors, (37), 4 states have call predecessors, (37), 8 states have return successors, (37), 9 states have call predecessors, (37), 6 states have call successors, (37) [2025-03-08 05:57:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 22233 states and 28708 transitions. [2025-03-08 05:57:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:57:21,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:57:21,355 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:57:21,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:57:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-08 05:57:21,556 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:57:21,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:57:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1670887480, now seen corresponding path program 1 times [2025-03-08 05:57:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:57:21,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380291870] [2025-03-08 05:57:21,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:21,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:57:21,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:57:21,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:57:21,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:21,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:57:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380291870] [2025-03-08 05:57:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380291870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:57:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662282418] [2025-03-08 05:57:21,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:57:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:57:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:57:21,858 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:57:21,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 05:57:21,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:57:22,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:57:22,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:57:22,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:57:22,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-08 05:57:22,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:57:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 05:57:22,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:57:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:57:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662282418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:57:22,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:57:22,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 20 [2025-03-08 05:57:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323214826] [2025-03-08 05:57:22,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:57:22,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:57:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:57:22,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:57:22,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:57:22,793 INFO L87 Difference]: Start difference. First operand 22233 states and 28708 transitions. Second operand has 20 states, 20 states have (on average 14.75) internal successors, (295), 20 states have internal predecessors, (295), 11 states have call successors, (47), 6 states have call predecessors, (47), 6 states have return successors, (46), 11 states have call predecessors, (46), 11 states have call successors, (46)