./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_Triplicated.ufo.UNBOUNDED.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 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:05:09,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:05:09,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:05:09,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:05:09,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:05:09,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:05:09,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:05:09,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:05:09,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:05:09,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:05:09,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:05:09,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:05:09,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:05:09,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:05:09,475 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:05:09,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:05:09,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:05:09,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:05:09,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:09,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:05:09,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:05:09,479 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 -> 6ff1cedc7411bab7c4dff496b498f1be2a7af9e572a1448d390780005c75fec3 [2025-03-16 19:05:09,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:05:09,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:05:09,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:05:09,719 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:05:09,719 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:05:09,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-16 19:05:10,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61096e403/902b2098ccd14bb49913e35102600c64/FLAG02ef4d585 [2025-03-16 19:05:11,113 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:05:11,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-16 19:05:11,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61096e403/902b2098ccd14bb49913e35102600c64/FLAG02ef4d585 [2025-03-16 19:05:11,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61096e403/902b2098ccd14bb49913e35102600c64 [2025-03-16 19:05:11,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:05:11,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:05:11,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:11,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:05:11,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:05:11,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@811b0f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11, skipping insertion in model container [2025-03-16 19:05:11,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:05:11,611 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_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-03-16 19:05:11,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:11,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:05:11,675 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_Triplicated.ufo.UNBOUNDED.pals.c[12106,12119] [2025-03-16 19:05:11,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:11,691 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:05:11,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11 WrapperNode [2025-03-16 19:05:11,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:11,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:11,693 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:05:11,693 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:05:11,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,725 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 418 [2025-03-16 19:05:11,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:11,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:05:11,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:05:11,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:05:11,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,744 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-16 19:05:11,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:05:11,764 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:05:11,764 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:05:11,764 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:05:11,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (1/1) ... [2025-03-16 19:05:11,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:11,793 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-16 19:05:11,797 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-16 19:05:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:05:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-16 19:05:11,814 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-16 19:05:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-16 19:05:11,814 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-16 19:05:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-16 19:05:11,814 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-16 19:05:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-16 19:05:11,815 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-16 19:05:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-16 19:05:11,815 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-16 19:05:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 19:05:11,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 19:05:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:05:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:05:11,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:05:11,899 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:05:11,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:05:12,328 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-16 19:05:12,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:05:12,339 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:05:12,339 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:05:12,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:12 BoogieIcfgContainer [2025-03-16 19:05:12,340 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:05:12,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:05:12,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:05:12,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:05:12,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:05:11" (1/3) ... [2025-03-16 19:05:12,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4f999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:12, skipping insertion in model container [2025-03-16 19:05:12,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:11" (2/3) ... [2025-03-16 19:05:12,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4f999f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:12, skipping insertion in model container [2025-03-16 19:05:12,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:12" (3/3) ... [2025-03-16 19:05:12,347 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c [2025-03-16 19:05:12,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:05:12,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.ufo.UNBOUNDED.pals.c that has 7 procedures, 174 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:05:12,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:05:12,420 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;@85fe7e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:05:12,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:05:12,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 129 states have (on average 1.5968992248062015) internal successors, (206), 134 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-16 19:05:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 19:05:12,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:12,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1343101749, now seen corresponding path program 1 times [2025-03-16 19:05:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066207746] [2025-03-16 19:05:12,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 19:05:12,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 19:05:12,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,664 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-16 19:05:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066207746] [2025-03-16 19:05:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066207746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403463320] [2025-03-16 19:05:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:12,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:12,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:12,682 INFO L87 Difference]: Start difference. First operand has 174 states, 129 states have (on average 1.5968992248062015) internal successors, (206), 134 states have internal predecessors, (206), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:05:12,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,769 INFO L93 Difference]: Finished difference Result 350 states and 601 transitions. [2025-03-16 19:05:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 19:05:12,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,778 INFO L225 Difference]: With dead ends: 350 [2025-03-16 19:05:12,778 INFO L226 Difference]: Without dead ends: 178 [2025-03-16 19:05:12,782 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-16 19:05:12,784 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 7 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:12,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 800 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-16 19:05:12,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2025-03-16 19:05:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.5714285714285714) internal successors, (209), 137 states have internal predecessors, (209), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-16 19:05:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 283 transitions. [2025-03-16 19:05:12,828 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 283 transitions. Word has length 14 [2025-03-16 19:05:12,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,828 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 283 transitions. [2025-03-16 19:05:12,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:05:12,828 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 283 transitions. [2025-03-16 19:05:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 19:05:12,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:12,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:05:12,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1359198905, now seen corresponding path program 1 times [2025-03-16 19:05:12,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665846966] [2025-03-16 19:05:12,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 19:05:12,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 19:05:12,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,926 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-16 19:05:12,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665846966] [2025-03-16 19:05:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665846966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:12,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:12,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147957095] [2025-03-16 19:05:12,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:12,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:12,928 INFO L87 Difference]: Start difference. First operand 178 states and 283 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:05:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,993 INFO L93 Difference]: Finished difference Result 368 states and 588 transitions. [2025-03-16 19:05:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-16 19:05:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,996 INFO L225 Difference]: With dead ends: 368 [2025-03-16 19:05:12,998 INFO L226 Difference]: Without dead ends: 192 [2025-03-16 19:05:12,999 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-16 19:05:12,999 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 818 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-16 19:05:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2025-03-16 19:05:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 143 states have (on average 1.5524475524475525) internal successors, (222), 147 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 298 transitions. [2025-03-16 19:05:13,023 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 298 transitions. Word has length 15 [2025-03-16 19:05:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,024 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 298 transitions. [2025-03-16 19:05:13,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:05:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 298 transitions. [2025-03-16 19:05:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 19:05:13,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,026 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:13,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:05:13,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,026 INFO L85 PathProgramCache]: Analyzing trace with hash 73986037, now seen corresponding path program 1 times [2025-03-16 19:05:13,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534262097] [2025-03-16 19:05:13,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 19:05:13,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 19:05:13,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534262097] [2025-03-16 19:05:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534262097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160468233] [2025-03-16 19:05:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:13,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:13,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:13,102 INFO L87 Difference]: Start difference. First operand 190 states and 298 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,119 INFO L93 Difference]: Finished difference Result 400 states and 634 transitions. [2025-03-16 19:05:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:13,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-16 19:05:13,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,122 INFO L225 Difference]: With dead ends: 400 [2025-03-16 19:05:13,122 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 19:05:13,122 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-16 19:05:13,123 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 22 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 548 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 19:05:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2025-03-16 19:05:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 145 states have (on average 1.5448275862068965) internal successors, (224), 149 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 300 transitions. [2025-03-16 19:05:13,140 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 300 transitions. Word has length 22 [2025-03-16 19:05:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 300 transitions. [2025-03-16 19:05:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 300 transitions. [2025-03-16 19:05:13,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 19:05:13,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,143 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] [2025-03-16 19:05:13,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:05:13,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash 523325189, now seen corresponding path program 1 times [2025-03-16 19:05:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103616248] [2025-03-16 19:05:13,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 19:05:13,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 19:05:13,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103616248] [2025-03-16 19:05:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103616248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716194013] [2025-03-16 19:05:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:13,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:13,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:13,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:13,259 INFO L87 Difference]: Start difference. First operand 192 states and 300 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,292 INFO L93 Difference]: Finished difference Result 376 states and 591 transitions. [2025-03-16 19:05:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-16 19:05:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,295 INFO L225 Difference]: With dead ends: 376 [2025-03-16 19:05:13,295 INFO L226 Difference]: Without dead ends: 198 [2025-03-16 19:05:13,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:13,296 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1090 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-16 19:05:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2025-03-16 19:05:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 152 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2025-03-16 19:05:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2025-03-16 19:05:13,305 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 31 [2025-03-16 19:05:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2025-03-16 19:05:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2025-03-16 19:05:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:05:13,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,306 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] [2025-03-16 19:05:13,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:05:13,307 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1705385861, now seen corresponding path program 1 times [2025-03-16 19:05:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-03-16 19:05:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:13,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313887334] [2025-03-16 19:05:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313887334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:13,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143876551] [2025-03-16 19:05:13,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:13,393 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-16 19:05:13,394 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-16 19:05:13,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:13,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:13,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:13,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:13,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:13,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:05:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143876551] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:13,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:05:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268431915] [2025-03-16 19:05:13,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:13,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:13,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:13,547 INFO L87 Difference]: Start difference. First operand 196 states and 304 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 19:05:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,588 INFO L93 Difference]: Finished difference Result 441 states and 697 transitions. [2025-03-16 19:05:13,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:13,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2025-03-16 19:05:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,591 INFO L225 Difference]: With dead ends: 441 [2025-03-16 19:05:13,591 INFO L226 Difference]: Without dead ends: 259 [2025-03-16 19:05:13,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:13,592 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 100 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 577 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-16 19:05:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 249. [2025-03-16 19:05:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 191 states have (on average 1.5078534031413613) internal successors, (288), 195 states have internal predecessors, (288), 48 states have call successors, (48), 8 states have call predecessors, (48), 9 states have return successors, (49), 49 states have call predecessors, (49), 48 states have call successors, (49) [2025-03-16 19:05:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 385 transitions. [2025-03-16 19:05:13,615 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 385 transitions. Word has length 33 [2025-03-16 19:05:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,615 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 385 transitions. [2025-03-16 19:05:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 19:05:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 385 transitions. [2025-03-16 19:05:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 19:05:13,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,616 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] [2025-03-16 19:05:13,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:05:13,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1738068361, now seen corresponding path program 1 times [2025-03-16 19:05:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47621321] [2025-03-16 19:05:13,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:13,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 19:05:13,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 19:05:13,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,914 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-16 19:05:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47621321] [2025-03-16 19:05:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47621321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028954027] [2025-03-16 19:05:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:13,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:13,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:13,915 INFO L87 Difference]: Start difference. First operand 249 states and 385 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 19:05:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:13,974 INFO L93 Difference]: Finished difference Result 393 states and 614 transitions. [2025-03-16 19:05:13,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:05:13,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-16 19:05:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:13,977 INFO L225 Difference]: With dead ends: 393 [2025-03-16 19:05:13,977 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 19:05:13,977 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-16 19:05:13,978 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:13,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1325 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 19:05:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2025-03-16 19:05:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.4787234042553192) internal successors, (278), 192 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 374 transitions. [2025-03-16 19:05:13,991 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 374 transitions. Word has length 34 [2025-03-16 19:05:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:13,992 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 374 transitions. [2025-03-16 19:05:13,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 19:05:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 374 transitions. [2025-03-16 19:05:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:13,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:13,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:13,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:05:13,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:13,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1172784763, now seen corresponding path program 2 times [2025-03-16 19:05:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:13,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790407827] [2025-03-16 19:05:13,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:05:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-16 19:05:14,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 55 statements. [2025-03-16 19:05:14,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:05:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 19:05:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790407827] [2025-03-16 19:05:14,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790407827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586580666] [2025-03-16 19:05:14,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,051 INFO L87 Difference]: Start difference. First operand 245 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,092 INFO L93 Difference]: Finished difference Result 470 states and 734 transitions. [2025-03-16 19:05:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:14,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-16 19:05:14,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,095 INFO L225 Difference]: With dead ends: 470 [2025-03-16 19:05:14,096 INFO L226 Difference]: Without dead ends: 252 [2025-03-16 19:05:14,097 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-16 19:05:14,098 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 8 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 790 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-16 19:05:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-16 19:05:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 194 states have (on average 1.4742268041237114) internal successors, (286), 198 states have internal predecessors, (286), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2025-03-16 19:05:14,110 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 55 [2025-03-16 19:05:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,111 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2025-03-16 19:05:14,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2025-03-16 19:05:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:14,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,112 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:14,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:05:14,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1339224593, now seen corresponding path program 1 times [2025-03-16 19:05:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086299] [2025-03-16 19:05:14,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:05:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:05:14,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 19:05:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086299] [2025-03-16 19:05:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316086299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815286317] [2025-03-16 19:05:14,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,172 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,204 INFO L93 Difference]: Finished difference Result 514 states and 790 transitions. [2025-03-16 19:05:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2025-03-16 19:05:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,206 INFO L225 Difference]: With dead ends: 514 [2025-03-16 19:05:14,207 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 19:05:14,207 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-16 19:05:14,208 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 22 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 805 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 19:05:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-03-16 19:05:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 225 states have (on average 1.431111111111111) internal successors, (322), 229 states have internal predecessors, (322), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-16 19:05:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 424 transitions. [2025-03-16 19:05:14,218 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 424 transitions. Word has length 55 [2025-03-16 19:05:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,218 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 424 transitions. [2025-03-16 19:05:14,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 424 transitions. [2025-03-16 19:05:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:05:14,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,219 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:14,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:05:14,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash -9742038, now seen corresponding path program 1 times [2025-03-16 19:05:14,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941913539] [2025-03-16 19:05:14,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:05:14,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:05:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-16 19:05:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941913539] [2025-03-16 19:05:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941913539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230378396] [2025-03-16 19:05:14,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:14,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:14,302 INFO L87 Difference]: Start difference. First operand 287 states and 424 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,328 INFO L93 Difference]: Finished difference Result 526 states and 790 transitions. [2025-03-16 19:05:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2025-03-16 19:05:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,330 INFO L225 Difference]: With dead ends: 526 [2025-03-16 19:05:14,330 INFO L226 Difference]: Without dead ends: 289 [2025-03-16 19:05:14,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:14,331 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1077 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-16 19:05:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-03-16 19:05:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 225 states have (on average 1.4177777777777778) internal successors, (319), 229 states have internal predecessors, (319), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-16 19:05:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 421 transitions. [2025-03-16 19:05:14,342 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 421 transitions. Word has length 73 [2025-03-16 19:05:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,342 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 421 transitions. [2025-03-16 19:05:14,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 421 transitions. [2025-03-16 19:05:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:05:14,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,343 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:14,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:05:14,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2017495434, now seen corresponding path program 1 times [2025-03-16 19:05:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060335570] [2025-03-16 19:05:14,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:05:14,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:05:14,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 19:05:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060335570] [2025-03-16 19:05:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060335570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939909676] [2025-03-16 19:05:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,432 INFO L87 Difference]: Start difference. First operand 287 states and 421 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,470 INFO L93 Difference]: Finished difference Result 561 states and 844 transitions. [2025-03-16 19:05:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:14,470 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 101 [2025-03-16 19:05:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,472 INFO L225 Difference]: With dead ends: 561 [2025-03-16 19:05:14,472 INFO L226 Difference]: Without dead ends: 329 [2025-03-16 19:05:14,473 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-16 19:05:14,474 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 23 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 805 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-16 19:05:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2025-03-16 19:05:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 261 states have (on average 1.3793103448275863) internal successors, (360), 265 states have internal predecessors, (360), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-16 19:05:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 468 transitions. [2025-03-16 19:05:14,498 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 468 transitions. Word has length 101 [2025-03-16 19:05:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,498 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 468 transitions. [2025-03-16 19:05:14,499 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,499 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 468 transitions. [2025-03-16 19:05:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:05:14,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,499 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:05:14,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 494309002, now seen corresponding path program 1 times [2025-03-16 19:05:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159466095] [2025-03-16 19:05:14,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:05:14,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:05:14,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-16 19:05:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159466095] [2025-03-16 19:05:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159466095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330192239] [2025-03-16 19:05:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,580 INFO L87 Difference]: Start difference. First operand 327 states and 468 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,618 INFO L93 Difference]: Finished difference Result 587 states and 864 transitions. [2025-03-16 19:05:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:14,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 102 [2025-03-16 19:05:14,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,621 INFO L225 Difference]: With dead ends: 587 [2025-03-16 19:05:14,621 INFO L226 Difference]: Without dead ends: 321 [2025-03-16 19:05:14,622 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-16 19:05:14,623 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 9 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 773 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-16 19:05:14,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2025-03-16 19:05:14,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 256 states have (on average 1.359375) internal successors, (348), 260 states have internal predecessors, (348), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-16 19:05:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 454 transitions. [2025-03-16 19:05:14,638 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 454 transitions. Word has length 102 [2025-03-16 19:05:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,639 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 454 transitions. [2025-03-16 19:05:14,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-16 19:05:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 454 transitions. [2025-03-16 19:05:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:05:14,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,640 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:14,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:05:14,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1935836610, now seen corresponding path program 1 times [2025-03-16 19:05:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60416180] [2025-03-16 19:05:14,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:05:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:05:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-03-16 19:05:14,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60416180] [2025-03-16 19:05:14,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60416180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648812115] [2025-03-16 19:05:14,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:14,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:14,724 INFO L87 Difference]: Start difference. First operand 321 states and 454 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,751 INFO L93 Difference]: Finished difference Result 563 states and 814 transitions. [2025-03-16 19:05:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 121 [2025-03-16 19:05:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,753 INFO L225 Difference]: With dead ends: 563 [2025-03-16 19:05:14,753 INFO L226 Difference]: Without dead ends: 323 [2025-03-16 19:05:14,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:14,754 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1061 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-16 19:05:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2025-03-16 19:05:14,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 256 states have (on average 1.34765625) internal successors, (345), 260 states have internal predecessors, (345), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-16 19:05:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 451 transitions. [2025-03-16 19:05:14,768 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 451 transitions. Word has length 121 [2025-03-16 19:05:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,768 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 451 transitions. [2025-03-16 19:05:14,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 451 transitions. [2025-03-16 19:05:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:05:14,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,769 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:14,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:05:14,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1026939838, now seen corresponding path program 1 times [2025-03-16 19:05:14,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689232181] [2025-03-16 19:05:14,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:05:14,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:05:14,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 19:05:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689232181] [2025-03-16 19:05:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689232181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255145541] [2025-03-16 19:05:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,849 INFO L87 Difference]: Start difference. First operand 321 states and 451 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,892 INFO L93 Difference]: Finished difference Result 526 states and 774 transitions. [2025-03-16 19:05:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 153 [2025-03-16 19:05:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,894 INFO L225 Difference]: With dead ends: 526 [2025-03-16 19:05:14,894 INFO L226 Difference]: Without dead ends: 319 [2025-03-16 19:05:14,895 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-16 19:05:14,895 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 7 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 741 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:14,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-16 19:05:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-03-16 19:05:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 255 states have (on average 1.3450980392156864) internal successors, (343), 259 states have internal predecessors, (343), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-16 19:05:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2025-03-16 19:05:14,905 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 153 [2025-03-16 19:05:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,906 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2025-03-16 19:05:14,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 19:05:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2025-03-16 19:05:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-16 19:05:14,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,907 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:14,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:05:14,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:14,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash -177524013, now seen corresponding path program 1 times [2025-03-16 19:05:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:14,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365965833] [2025-03-16 19:05:14,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:14,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:14,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-16 19:05:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-16 19:05:14,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:14,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2025-03-16 19:05:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365965833] [2025-03-16 19:05:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365965833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:14,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:14,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759443231] [2025-03-16 19:05:14,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:14,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:14,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:14,997 INFO L87 Difference]: Start difference. First operand 319 states and 447 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:05:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,040 INFO L93 Difference]: Finished difference Result 466 states and 670 transitions. [2025-03-16 19:05:15,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 172 [2025-03-16 19:05:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,043 INFO L225 Difference]: With dead ends: 466 [2025-03-16 19:05:15,043 INFO L226 Difference]: Without dead ends: 302 [2025-03-16 19:05:15,043 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-16 19:05:15,043 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 32 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:15,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 718 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-16 19:05:15,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-16 19:05:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 241 states have (on average 1.3360995850622406) internal successors, (322), 245 states have internal predecessors, (322), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-16 19:05:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-16 19:05:15,054 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 172 [2025-03-16 19:05:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-16 19:05:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:05:15,055 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-16 19:05:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 19:05:15,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,056 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:15,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:05:15,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1216424604, now seen corresponding path program 1 times [2025-03-16 19:05:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121039281] [2025-03-16 19:05:15,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-16 19:05:15,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-16 19:05:15,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-03-16 19:05:15,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121039281] [2025-03-16 19:05:15,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121039281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32544669] [2025-03-16 19:05:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:15,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:15,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:15,148 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:05:15,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,189 INFO L93 Difference]: Finished difference Result 449 states and 643 transitions. [2025-03-16 19:05:15,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:15,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 174 [2025-03-16 19:05:15,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,191 INFO L225 Difference]: With dead ends: 449 [2025-03-16 19:05:15,192 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 19:05:15,192 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-16 19:05:15,192 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 28 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:15,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 721 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 19:05:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-16 19:05:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.3288888888888888) internal successors, (299), 229 states have internal predecessors, (299), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 391 transitions. [2025-03-16 19:05:15,211 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 391 transitions. Word has length 174 [2025-03-16 19:05:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,211 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 391 transitions. [2025-03-16 19:05:15,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 19:05:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 391 transitions. [2025-03-16 19:05:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 19:05:15,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,214 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:15,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:05:15,215 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -803276341, now seen corresponding path program 1 times [2025-03-16 19:05:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-03-16 19:05:15,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 19:05:15,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 19:05:15,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 19:05:15,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080154316] [2025-03-16 19:05:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080154316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:15,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:15,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036741187] [2025-03-16 19:05:15,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:15,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:15,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:15,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:15,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:15,320 INFO L87 Difference]: Start difference. First operand 283 states and 391 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 19:05:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,344 INFO L93 Difference]: Finished difference Result 430 states and 614 transitions. [2025-03-16 19:05:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 175 [2025-03-16 19:05:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,346 INFO L225 Difference]: With dead ends: 430 [2025-03-16 19:05:15,346 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 19:05:15,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:15,348 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:15,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 19:05:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-16 19:05:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 229 states have internal predecessors, (293), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 385 transitions. [2025-03-16 19:05:15,359 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 385 transitions. Word has length 175 [2025-03-16 19:05:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,360 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 385 transitions. [2025-03-16 19:05:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 19:05:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 385 transitions. [2025-03-16 19:05:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 19:05:15,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,362 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:15,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:05:15,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1286854246, now seen corresponding path program 1 times [2025-03-16 19:05:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466281698] [2025-03-16 19:05:15,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 19:05:15,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 19:05:15,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:15,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466281698] [2025-03-16 19:05:15,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466281698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:15,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810136221] [2025-03-16 19:05:15,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:15,441 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-16 19:05:15,443 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-16 19:05:15,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 19:05:15,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 19:05:15,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:15,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 135 proven. 11 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:15,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-03-16 19:05:15,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810136221] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:15,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:05:15,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-03-16 19:05:15,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771619876] [2025-03-16 19:05:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:15,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:15,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:15,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:15,741 INFO L87 Difference]: Start difference. First operand 283 states and 385 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:15,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,771 INFO L93 Difference]: Finished difference Result 450 states and 635 transitions. [2025-03-16 19:05:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:15,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 181 [2025-03-16 19:05:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,774 INFO L225 Difference]: With dead ends: 450 [2025-03-16 19:05:15,774 INFO L226 Difference]: Without dead ends: 262 [2025-03-16 19:05:15,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 361 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-16 19:05:15,775 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 19 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:15,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 721 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-16 19:05:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-03-16 19:05:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 211 states have internal predecessors, (268), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 354 transitions. [2025-03-16 19:05:15,784 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 354 transitions. Word has length 181 [2025-03-16 19:05:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,785 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 354 transitions. [2025-03-16 19:05:15,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 354 transitions. [2025-03-16 19:05:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 19:05:15,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,786 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:15,793 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-16 19:05:15,986 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,SelfDestructingSolverStorable16 [2025-03-16 19:05:15,987 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 98417967, now seen corresponding path program 1 times [2025-03-16 19:05:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274551053] [2025-03-16 19:05:15,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 19:05:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 19:05:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 19:05:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274551053] [2025-03-16 19:05:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274551053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092994412] [2025-03-16 19:05:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:16,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:16,074 INFO L87 Difference]: Start difference. First operand 262 states and 354 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-16 19:05:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,100 INFO L93 Difference]: Finished difference Result 406 states and 574 transitions. [2025-03-16 19:05:16,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:16,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 205 [2025-03-16 19:05:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,103 INFO L225 Difference]: With dead ends: 406 [2025-03-16 19:05:16,104 INFO L226 Difference]: Without dead ends: 266 [2025-03-16 19:05:16,104 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-16 19:05:16,105 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 3 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 761 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-16 19:05:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-16 19:05:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 214 states have internal predecessors, (271), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 357 transitions. [2025-03-16 19:05:16,124 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 357 transitions. Word has length 205 [2025-03-16 19:05:16,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,125 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 357 transitions. [2025-03-16 19:05:16,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-16 19:05:16,125 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 357 transitions. [2025-03-16 19:05:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-16 19:05:16,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,127 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:05:16,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1834826913, now seen corresponding path program 1 times [2025-03-16 19:05:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618228322] [2025-03-16 19:05:16,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-16 19:05:16,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-16 19:05:16,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2025-03-16 19:05:16,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618228322] [2025-03-16 19:05:16,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618228322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729914105] [2025-03-16 19:05:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:16,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:16,251 INFO L87 Difference]: Start difference. First operand 266 states and 357 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, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:05:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,285 INFO L93 Difference]: Finished difference Result 415 states and 582 transitions. [2025-03-16 19:05:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:16,286 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, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 212 [2025-03-16 19:05:16,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,288 INFO L225 Difference]: With dead ends: 415 [2025-03-16 19:05:16,288 INFO L226 Difference]: Without dead ends: 271 [2025-03-16 19:05:16,288 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-16 19:05:16,288 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 763 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-16 19:05:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-03-16 19:05:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 214 states have (on average 1.2850467289719627) internal successors, (275), 218 states have internal predecessors, (275), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 361 transitions. [2025-03-16 19:05:16,299 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 361 transitions. Word has length 212 [2025-03-16 19:05:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,301 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 361 transitions. [2025-03-16 19:05:16,301 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, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-16 19:05:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2025-03-16 19:05:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 19:05:16,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,303 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:16,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:05:16,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash -586994578, now seen corresponding path program 1 times [2025-03-16 19:05:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587891724] [2025-03-16 19:05:16,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 19:05:16,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 19:05:16,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 19:05:16,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587891724] [2025-03-16 19:05:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587891724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:16,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966858060] [2025-03-16 19:05:16,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:16,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:16,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:16,413 INFO L87 Difference]: Start difference. First operand 271 states and 361 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,440 INFO L93 Difference]: Finished difference Result 419 states and 582 transitions. [2025-03-16 19:05:16,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 220 [2025-03-16 19:05:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,453 INFO L225 Difference]: With dead ends: 419 [2025-03-16 19:05:16,453 INFO L226 Difference]: Without dead ends: 270 [2025-03-16 19:05:16,453 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-16 19:05:16,454 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 5 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-16 19:05:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-03-16 19:05:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 214 states have (on average 1.2710280373831775) internal successors, (272), 217 states have internal predecessors, (272), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-16 19:05:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 356 transitions. [2025-03-16 19:05:16,464 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 356 transitions. Word has length 220 [2025-03-16 19:05:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,465 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 356 transitions. [2025-03-16 19:05:16,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:16,465 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 356 transitions. [2025-03-16 19:05:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-16 19:05:16,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,467 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:16,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:05:16,467 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1449196002, now seen corresponding path program 1 times [2025-03-16 19:05:16,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556363308] [2025-03-16 19:05:16,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-16 19:05:16,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-16 19:05:16,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-16 19:05:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556363308] [2025-03-16 19:05:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556363308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555067810] [2025-03-16 19:05:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:16,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:16,570 INFO L87 Difference]: Start difference. First operand 270 states and 356 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 19:05:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,582 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2025-03-16 19:05:16,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:16,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 228 [2025-03-16 19:05:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,584 INFO L225 Difference]: With dead ends: 417 [2025-03-16 19:05:16,584 INFO L226 Difference]: Without dead ends: 269 [2025-03-16 19:05:16,584 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-16 19:05:16,585 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 502 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:16,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-16 19:05:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-16 19:05:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 214 states have (on average 1.266355140186916) internal successors, (271), 216 states have internal predecessors, (271), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-16 19:05:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 353 transitions. [2025-03-16 19:05:16,597 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 353 transitions. Word has length 228 [2025-03-16 19:05:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 353 transitions. [2025-03-16 19:05:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 19:05:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 353 transitions. [2025-03-16 19:05:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-16 19:05:16,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:16,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:05:16,599 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 348819594, now seen corresponding path program 1 times [2025-03-16 19:05:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294478446] [2025-03-16 19:05:16,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-16 19:05:16,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-16 19:05:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,795 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2025-03-16 19:05:16,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294478446] [2025-03-16 19:05:16,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294478446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:16,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784965522] [2025-03-16 19:05:16,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:16,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:16,796 INFO L87 Difference]: Start difference. First operand 269 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 19:05:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,866 INFO L93 Difference]: Finished difference Result 628 states and 851 transitions. [2025-03-16 19:05:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 230 [2025-03-16 19:05:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,871 INFO L225 Difference]: With dead ends: 628 [2025-03-16 19:05:16,871 INFO L226 Difference]: Without dead ends: 481 [2025-03-16 19:05:16,871 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-16 19:05:16,872 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 325 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 716 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-16 19:05:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2025-03-16 19:05:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 373 states have (on average 1.3163538873994638) internal successors, (491), 375 states have internal predecessors, (491), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-16 19:05:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 631 transitions. [2025-03-16 19:05:16,891 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 631 transitions. Word has length 230 [2025-03-16 19:05:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,892 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 631 transitions. [2025-03-16 19:05:16,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 19:05:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 631 transitions. [2025-03-16 19:05:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 19:05:16,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:05:16,894 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:16,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -149267319, now seen corresponding path program 1 times [2025-03-16 19:05:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:16,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661241886] [2025-03-16 19:05:16,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:16,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:16,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 19:05:16,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 19:05:16,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 19:05:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661241886] [2025-03-16 19:05:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661241886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023018906] [2025-03-16 19:05:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:16,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:16,980 INFO L87 Difference]: Start difference. First operand 475 states and 631 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 19:05:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:17,014 INFO L93 Difference]: Finished difference Result 1044 states and 1437 transitions. [2025-03-16 19:05:17,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 261 [2025-03-16 19:05:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:17,019 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 19:05:17,019 INFO L226 Difference]: Without dead ends: 763 [2025-03-16 19:05:17,019 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-16 19:05:17,020 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 176 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 526 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-16 19:05:17,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 526 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-16 19:05:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 594. [2025-03-16 19:05:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 467 states have (on average 1.3254817987152034) internal successors, (619), 473 states have internal predecessors, (619), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-16 19:05:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 789 transitions. [2025-03-16 19:05:17,058 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 789 transitions. Word has length 261 [2025-03-16 19:05:17,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:17,059 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 789 transitions. [2025-03-16 19:05:17,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 19:05:17,059 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 789 transitions. [2025-03-16 19:05:17,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-16 19:05:17,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:17,062 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:17,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:05:17,062 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1418042819, now seen corresponding path program 1 times [2025-03-16 19:05:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556240212] [2025-03-16 19:05:17,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-16 19:05:17,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-16 19:05:17,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 19:05:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556240212] [2025-03-16 19:05:17,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556240212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:17,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395007107] [2025-03-16 19:05:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:17,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:17,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:17,147 INFO L87 Difference]: Start difference. First operand 594 states and 789 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 19:05:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:17,188 INFO L93 Difference]: Finished difference Result 1318 states and 1801 transitions. [2025-03-16 19:05:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:17,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 262 [2025-03-16 19:05:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:17,193 INFO L225 Difference]: With dead ends: 1318 [2025-03-16 19:05:17,193 INFO L226 Difference]: Without dead ends: 951 [2025-03-16 19:05:17,194 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-16 19:05:17,194 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 178 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 544 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-16 19:05:17,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 544 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-16 19:05:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 943. [2025-03-16 19:05:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 736 states have (on average 1.3532608695652173) internal successors, (996), 750 states have internal predecessors, (996), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-16 19:05:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1274 transitions. [2025-03-16 19:05:17,235 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1274 transitions. Word has length 262 [2025-03-16 19:05:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1274 transitions. [2025-03-16 19:05:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-16 19:05:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1274 transitions. [2025-03-16 19:05:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 19:05:17,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:17,238 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:05:17,238 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash -244181722, now seen corresponding path program 1 times [2025-03-16 19:05:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819291038] [2025-03-16 19:05:17,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 19:05:17,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 19:05:17,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 19:05:17,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:17,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819291038] [2025-03-16 19:05:17,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819291038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:17,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133320883] [2025-03-16 19:05:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:17,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:17,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:17,330 INFO L87 Difference]: Start difference. First operand 943 states and 1274 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:17,416 INFO L93 Difference]: Finished difference Result 2203 states and 3052 transitions. [2025-03-16 19:05:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:17,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 263 [2025-03-16 19:05:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:17,428 INFO L225 Difference]: With dead ends: 2203 [2025-03-16 19:05:17,428 INFO L226 Difference]: Without dead ends: 1527 [2025-03-16 19:05:17,430 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-16 19:05:17,430 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 179 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 561 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-16 19:05:17,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 561 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-16 19:05:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1513. [2025-03-16 19:05:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1174 states have (on average 1.3798977853492334) internal successors, (1620), 1202 states have internal predecessors, (1620), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-16 19:05:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2082 transitions. [2025-03-16 19:05:17,526 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2082 transitions. Word has length 263 [2025-03-16 19:05:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2082 transitions. [2025-03-16 19:05:17,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2082 transitions. [2025-03-16 19:05:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 19:05:17,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:17,529 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:17,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:05:17,530 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1706118533, now seen corresponding path program 1 times [2025-03-16 19:05:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600360265] [2025-03-16 19:05:17,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 19:05:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 19:05:17,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-16 19:05:17,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:17,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600360265] [2025-03-16 19:05:17,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600360265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:17,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492849296] [2025-03-16 19:05:17,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:17,717 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-16 19:05:17,719 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-16 19:05:17,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 19:05:17,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 19:05:17,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:17,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:17,917 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-16 19:05:17,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:17,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492849296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:17,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:17,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74500037] [2025-03-16 19:05:17,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:17,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:17,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:17,918 INFO L87 Difference]: Start difference. First operand 1513 states and 2082 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:18,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:18,028 INFO L93 Difference]: Finished difference Result 2799 states and 3909 transitions. [2025-03-16 19:05:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:18,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 263 [2025-03-16 19:05:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:18,036 INFO L225 Difference]: With dead ends: 2799 [2025-03-16 19:05:18,036 INFO L226 Difference]: Without dead ends: 1513 [2025-03-16 19:05:18,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:05:18,039 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 31 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:18,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 688 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:18,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-03-16 19:05:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1513. [2025-03-16 19:05:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1174 states have (on average 1.3594548551959114) internal successors, (1596), 1202 states have internal predecessors, (1596), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-16 19:05:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2058 transitions. [2025-03-16 19:05:18,119 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2058 transitions. Word has length 263 [2025-03-16 19:05:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:18,119 INFO L471 AbstractCegarLoop]: Abstraction has 1513 states and 2058 transitions. [2025-03-16 19:05:18,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2058 transitions. [2025-03-16 19:05:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-16 19:05:18,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:18,122 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:18,129 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-16 19:05:18,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:18,323 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:18,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2069719956, now seen corresponding path program 1 times [2025-03-16 19:05:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:18,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139483724] [2025-03-16 19:05:18,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:18,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 19:05:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 19:05:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-03-16 19:05:18,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:18,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139483724] [2025-03-16 19:05:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139483724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:18,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037338134] [2025-03-16 19:05:18,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:18,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:18,485 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-16 19:05:18,487 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-16 19:05:18,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-16 19:05:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-16 19:05:18,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:18,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:18,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:18,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-16 19:05:18,699 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037338134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391663549] [2025-03-16 19:05:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:18,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:18,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:18,700 INFO L87 Difference]: Start difference. First operand 1513 states and 2058 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:18,814 INFO L93 Difference]: Finished difference Result 2799 states and 3853 transitions. [2025-03-16 19:05:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:18,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 264 [2025-03-16 19:05:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:18,823 INFO L225 Difference]: With dead ends: 2799 [2025-03-16 19:05:18,823 INFO L226 Difference]: Without dead ends: 1561 [2025-03-16 19:05:18,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:05:18,826 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 7 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:18,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 696 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:18,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-03-16 19:05:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2025-03-16 19:05:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1214 states have (on average 1.3607907742998353) internal successors, (1652), 1242 states have internal predecessors, (1652), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2025-03-16 19:05:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2114 transitions. [2025-03-16 19:05:18,891 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2114 transitions. Word has length 264 [2025-03-16 19:05:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:18,891 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2114 transitions. [2025-03-16 19:05:18,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-16 19:05:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2114 transitions. [2025-03-16 19:05:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 19:05:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:18,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:18,902 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-16 19:05:19,094 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,SelfDestructingSolverStorable26 [2025-03-16 19:05:19,095 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:19,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:19,096 INFO L85 PathProgramCache]: Analyzing trace with hash -36595525, now seen corresponding path program 1 times [2025-03-16 19:05:19,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:19,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949348378] [2025-03-16 19:05:19,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:19,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 19:05:19,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 19:05:19,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:19,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-03-16 19:05:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:19,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949348378] [2025-03-16 19:05:19,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949348378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:19,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:19,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125457164] [2025-03-16 19:05:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:19,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:19,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:19,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:19,406 INFO L87 Difference]: Start difference. First operand 1561 states and 2114 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 19:05:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:19,536 INFO L93 Difference]: Finished difference Result 2383 states and 3461 transitions. [2025-03-16 19:05:19,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:19,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 265 [2025-03-16 19:05:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:19,549 INFO L225 Difference]: With dead ends: 2383 [2025-03-16 19:05:19,549 INFO L226 Difference]: Without dead ends: 2381 [2025-03-16 19:05:19,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:19,552 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 117 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:19,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1783 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2025-03-16 19:05:19,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 1609. [2025-03-16 19:05:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1246 states have (on average 1.3515248796147672) internal successors, (1684), 1282 states have internal predecessors, (1684), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-16 19:05:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2162 transitions. [2025-03-16 19:05:19,659 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2162 transitions. Word has length 265 [2025-03-16 19:05:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:19,659 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2162 transitions. [2025-03-16 19:05:19,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-16 19:05:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2162 transitions. [2025-03-16 19:05:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 19:05:19,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:19,662 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:19,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:05:19,663 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2033150235, now seen corresponding path program 1 times [2025-03-16 19:05:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:19,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913293240] [2025-03-16 19:05:19,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:19,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 19:05:19,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 19:05:19,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:19,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-16 19:05:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913293240] [2025-03-16 19:05:19,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913293240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025120791] [2025-03-16 19:05:19,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:19,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:19,927 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-16 19:05:19,929 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-16 19:05:20,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 19:05:20,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 19:05:20,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:20,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:20,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 19:05:20,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 248 proven. 37 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-16 19:05:20,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-16 19:05:20,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025120791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:20,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:20,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-16 19:05:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094552243] [2025-03-16 19:05:20,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:20,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:05:20,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:20,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:05:20,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:05:20,615 INFO L87 Difference]: Start difference. First operand 1609 states and 2162 transitions. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 14 states have internal predecessors, (147), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-16 19:05:21,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:21,039 INFO L93 Difference]: Finished difference Result 3964 states and 5522 transitions. [2025-03-16 19:05:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:05:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 14 states have internal predecessors, (147), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 273 [2025-03-16 19:05:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:21,051 INFO L225 Difference]: With dead ends: 3964 [2025-03-16 19:05:21,051 INFO L226 Difference]: Without dead ends: 2630 [2025-03-16 19:05:21,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 537 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:05:21,055 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 222 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:21,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 3455 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2025-03-16 19:05:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2394. [2025-03-16 19:05:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 1848 states have (on average 1.3398268398268398) internal successors, (2476), 1900 states have internal predecessors, (2476), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2025-03-16 19:05:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3196 transitions. [2025-03-16 19:05:21,171 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3196 transitions. Word has length 273 [2025-03-16 19:05:21,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:21,172 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 3196 transitions. [2025-03-16 19:05:21,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 14 states have internal predecessors, (147), 5 states have call successors, (29), 4 states have call predecessors, (29), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2025-03-16 19:05:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3196 transitions. [2025-03-16 19:05:21,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-16 19:05:21,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:21,177 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:21,184 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-16 19:05:21,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 19:05:21,378 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:21,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:21,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1071536218, now seen corresponding path program 1 times [2025-03-16 19:05:21,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:21,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93943630] [2025-03-16 19:05:21,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 19:05:21,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 19:05:21,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:21,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:21,486 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-16 19:05:21,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93943630] [2025-03-16 19:05:21,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93943630] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:21,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630005137] [2025-03-16 19:05:21,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:21,489 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-16 19:05:21,491 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-16 19:05:21,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-16 19:05:21,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-16 19:05:21,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:21,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:21,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:21,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2025-03-16 19:05:21,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630005137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705655208] [2025-03-16 19:05:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:21,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:21,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:21,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:21,681 INFO L87 Difference]: Start difference. First operand 2394 states and 3196 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-16 19:05:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:21,798 INFO L93 Difference]: Finished difference Result 4625 states and 6272 transitions. [2025-03-16 19:05:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 273 [2025-03-16 19:05:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:21,809 INFO L225 Difference]: With dead ends: 4625 [2025-03-16 19:05:21,809 INFO L226 Difference]: Without dead ends: 2330 [2025-03-16 19:05:21,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 275 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-16 19:05:21,814 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:21,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 696 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-03-16 19:05:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2330. [2025-03-16 19:05:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1804 states have (on average 1.3226164079822615) internal successors, (2386), 1856 states have internal predecessors, (2386), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2025-03-16 19:05:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3070 transitions. [2025-03-16 19:05:21,917 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3070 transitions. Word has length 273 [2025-03-16 19:05:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:21,918 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3070 transitions. [2025-03-16 19:05:21,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-16 19:05:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3070 transitions. [2025-03-16 19:05:21,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-16 19:05:21,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:21,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:21,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:22,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:22,122 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:22,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1333440849, now seen corresponding path program 1 times [2025-03-16 19:05:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29756192] [2025-03-16 19:05:22,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:22,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-16 19:05:22,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-16 19:05:22,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:22,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-03-16 19:05:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29756192] [2025-03-16 19:05:22,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29756192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:22,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387207077] [2025-03-16 19:05:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:22,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:22,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:22,236 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-16 19:05:22,238 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-16 19:05:22,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-16 19:05:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-16 19:05:22,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:22,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:22,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:22,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-16 19:05:22,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387207077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689498870] [2025-03-16 19:05:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:22,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:22,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:22,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:22,451 INFO L87 Difference]: Start difference. First operand 2330 states and 3070 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 19:05:22,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:22,588 INFO L93 Difference]: Finished difference Result 4408 states and 5914 transitions. [2025-03-16 19:05:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:22,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 276 [2025-03-16 19:05:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:22,601 INFO L225 Difference]: With dead ends: 4408 [2025-03-16 19:05:22,601 INFO L226 Difference]: Without dead ends: 2159 [2025-03-16 19:05:22,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 277 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-16 19:05:22,609 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:22,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 724 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2025-03-16 19:05:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 2159. [2025-03-16 19:05:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 1663 states have (on average 1.3168971737823212) internal successors, (2190), 1715 states have internal predecessors, (2190), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2025-03-16 19:05:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2836 transitions. [2025-03-16 19:05:22,707 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2836 transitions. Word has length 276 [2025-03-16 19:05:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:22,707 INFO L471 AbstractCegarLoop]: Abstraction has 2159 states and 2836 transitions. [2025-03-16 19:05:22,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-16 19:05:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2836 transitions. [2025-03-16 19:05:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-16 19:05:22,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:22,711 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:22,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 19:05:22,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:22,913 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:22,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -861257407, now seen corresponding path program 1 times [2025-03-16 19:05:22,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:22,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971014525] [2025-03-16 19:05:22,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:22,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:22,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 19:05:22,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 19:05:22,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:22,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-16 19:05:23,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971014525] [2025-03-16 19:05:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971014525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14482115] [2025-03-16 19:05:23,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:23,178 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-16 19:05:23,180 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-16 19:05:23,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 19:05:23,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 19:05:23,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:23,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:23,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:23,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:23,526 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14482115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:23,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:23,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-16 19:05:23,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859921142] [2025-03-16 19:05:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:23,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:23,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:05:23,528 INFO L87 Difference]: Start difference. First operand 2159 states and 2836 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:24,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:24,175 INFO L93 Difference]: Finished difference Result 7013 states and 9174 transitions. [2025-03-16 19:05:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:24,176 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 288 [2025-03-16 19:05:24,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:24,202 INFO L225 Difference]: With dead ends: 7013 [2025-03-16 19:05:24,202 INFO L226 Difference]: Without dead ends: 5415 [2025-03-16 19:05:24,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:05:24,210 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 624 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 2858 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:24,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 2858 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:05:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2025-03-16 19:05:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5143. [2025-03-16 19:05:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5143 states, 3924 states have (on average 1.3024974515800203) internal successors, (5111), 4052 states have internal predecessors, (5111), 787 states have call successors, (787), 431 states have call predecessors, (787), 431 states have return successors, (787), 667 states have call predecessors, (787), 787 states have call successors, (787) [2025-03-16 19:05:24,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5143 states to 5143 states and 6685 transitions. [2025-03-16 19:05:24,454 INFO L78 Accepts]: Start accepts. Automaton has 5143 states and 6685 transitions. Word has length 288 [2025-03-16 19:05:24,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:24,454 INFO L471 AbstractCegarLoop]: Abstraction has 5143 states and 6685 transitions. [2025-03-16 19:05:24,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5143 states and 6685 transitions. [2025-03-16 19:05:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 19:05:24,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:24,457 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:24,465 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-16 19:05:24,658 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,SelfDestructingSolverStorable31 [2025-03-16 19:05:24,658 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:24,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:24,659 INFO L85 PathProgramCache]: Analyzing trace with hash -129514850, now seen corresponding path program 1 times [2025-03-16 19:05:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640948197] [2025-03-16 19:05:24,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:24,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:24,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 19:05:24,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 19:05:24,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:24,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-03-16 19:05:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:24,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640948197] [2025-03-16 19:05:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640948197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:24,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608932603] [2025-03-16 19:05:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:24,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:24,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:24,797 INFO L87 Difference]: Start difference. First operand 5143 states and 6685 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:24,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:24,968 INFO L93 Difference]: Finished difference Result 10325 states and 13682 transitions. [2025-03-16 19:05:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:05:24,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 294 [2025-03-16 19:05:24,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:24,994 INFO L225 Difference]: With dead ends: 10325 [2025-03-16 19:05:24,994 INFO L226 Difference]: Without dead ends: 5683 [2025-03-16 19:05:25,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:25,005 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 37 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:25,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 774 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5683 states. [2025-03-16 19:05:25,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5683 to 5575. [2025-03-16 19:05:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5575 states, 4272 states have (on average 1.3125) internal successors, (5607), 4400 states have internal predecessors, (5607), 871 states have call successors, (871), 431 states have call predecessors, (871), 431 states have return successors, (871), 751 states have call predecessors, (871), 871 states have call successors, (871) [2025-03-16 19:05:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5575 states to 5575 states and 7349 transitions. [2025-03-16 19:05:25,281 INFO L78 Accepts]: Start accepts. Automaton has 5575 states and 7349 transitions. Word has length 294 [2025-03-16 19:05:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 5575 states and 7349 transitions. [2025-03-16 19:05:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 5575 states and 7349 transitions. [2025-03-16 19:05:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 19:05:25,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:25,285 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:05:25,286 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1102761308, now seen corresponding path program 1 times [2025-03-16 19:05:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594555119] [2025-03-16 19:05:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:25,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:25,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 19:05:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 19:05:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-16 19:05:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594555119] [2025-03-16 19:05:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594555119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369466505] [2025-03-16 19:05:25,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:25,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:25,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:25,579 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-16 19:05:25,580 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-16 19:05:25,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 19:05:25,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 19:05:25,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:25,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:25,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:25,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:25,876 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:25,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369466505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:25,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2025-03-16 19:05:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098102527] [2025-03-16 19:05:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:25,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:25,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:05:25,878 INFO L87 Difference]: Start difference. First operand 5575 states and 7349 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:26,667 INFO L93 Difference]: Finished difference Result 16625 states and 21742 transitions. [2025-03-16 19:05:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:26,667 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 294 [2025-03-16 19:05:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:26,700 INFO L225 Difference]: With dead ends: 16625 [2025-03-16 19:05:26,701 INFO L226 Difference]: Without dead ends: 11555 [2025-03-16 19:05:26,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-16 19:05:26,711 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 619 mSDsluCounter, 2488 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:26,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 2892 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:05:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2025-03-16 19:05:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 8011. [2025-03-16 19:05:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8011 states, 6116 states have (on average 1.3078809679529104) internal successors, (7999), 6308 states have internal predecessors, (7999), 1271 states have call successors, (1271), 623 states have call predecessors, (1271), 623 states have return successors, (1271), 1087 states have call predecessors, (1271), 1271 states have call successors, (1271) [2025-03-16 19:05:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 10541 transitions. [2025-03-16 19:05:27,077 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 10541 transitions. Word has length 294 [2025-03-16 19:05:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:27,077 INFO L471 AbstractCegarLoop]: Abstraction has 8011 states and 10541 transitions. [2025-03-16 19:05:27,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-16 19:05:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 10541 transitions. [2025-03-16 19:05:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 19:05:27,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:27,081 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:27,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:27,281 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-16 19:05:27,282 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:27,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:27,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1546288732, now seen corresponding path program 1 times [2025-03-16 19:05:27,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:27,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096206913] [2025-03-16 19:05:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:27,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:27,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 19:05:27,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 19:05:27,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:27,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 765 trivial. 0 not checked. [2025-03-16 19:05:27,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096206913] [2025-03-16 19:05:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096206913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:27,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871564032] [2025-03-16 19:05:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:27,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:27,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:27,625 INFO L87 Difference]: Start difference. First operand 8011 states and 10541 transitions. Second operand has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 19:05:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:27,995 INFO L93 Difference]: Finished difference Result 15012 states and 19817 transitions. [2025-03-16 19:05:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:27,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 294 [2025-03-16 19:05:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:28,029 INFO L225 Difference]: With dead ends: 15012 [2025-03-16 19:05:28,029 INFO L226 Difference]: Without dead ends: 7882 [2025-03-16 19:05:28,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:28,044 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 0 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:28,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 965 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7882 states. [2025-03-16 19:05:28,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7882 to 7882. [2025-03-16 19:05:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7882 states, 6010 states have (on average 1.3058236272878536) internal successors, (7848), 6190 states have internal predecessors, (7848), 1260 states have call successors, (1260), 612 states have call predecessors, (1260), 611 states have return successors, (1259), 1086 states have call predecessors, (1259), 1259 states have call successors, (1259) [2025-03-16 19:05:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7882 states to 7882 states and 10367 transitions. [2025-03-16 19:05:28,494 INFO L78 Accepts]: Start accepts. Automaton has 7882 states and 10367 transitions. Word has length 294 [2025-03-16 19:05:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:28,495 INFO L471 AbstractCegarLoop]: Abstraction has 7882 states and 10367 transitions. [2025-03-16 19:05:28,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.25) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 19:05:28,495 INFO L276 IsEmpty]: Start isEmpty. Operand 7882 states and 10367 transitions. [2025-03-16 19:05:28,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 19:05:28,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:28,498 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:28,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:05:28,498 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:28,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1177797423, now seen corresponding path program 1 times [2025-03-16 19:05:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553868627] [2025-03-16 19:05:28,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:28,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:28,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 19:05:28,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 19:05:28,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:28,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-16 19:05:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553868627] [2025-03-16 19:05:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553868627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269524117] [2025-03-16 19:05:29,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:29,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:29,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:29,034 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-16 19:05:29,035 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-16 19:05:29,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 19:05:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 19:05:29,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:29,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:29,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 195 proven. 4 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2025-03-16 19:05:29,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2025-03-16 19:05:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269524117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:29,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 14 [2025-03-16 19:05:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910326243] [2025-03-16 19:05:29,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:05:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:05:29,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:05:29,450 INFO L87 Difference]: Start difference. First operand 7882 states and 10367 transitions. Second operand has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 13 states have internal predecessors, (149), 6 states have call successors, (40), 4 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-16 19:05:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:30,589 INFO L93 Difference]: Finished difference Result 16062 states and 21020 transitions. [2025-03-16 19:05:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 19:05:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 13 states have internal predecessors, (149), 6 states have call successors, (40), 4 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 299 [2025-03-16 19:05:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:30,617 INFO L225 Difference]: With dead ends: 16062 [2025-03-16 19:05:30,617 INFO L226 Difference]: Without dead ends: 8854 [2025-03-16 19:05:30,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:05:30,631 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 955 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:30,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 2936 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:05:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8854 states. [2025-03-16 19:05:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8854 to 7658. [2025-03-16 19:05:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7658 states, 5840 states have (on average 1.2976027397260275) internal successors, (7578), 6016 states have internal predecessors, (7578), 1208 states have call successors, (1208), 610 states have call predecessors, (1208), 609 states have return successors, (1207), 1038 states have call predecessors, (1207), 1207 states have call successors, (1207) [2025-03-16 19:05:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 9993 transitions. [2025-03-16 19:05:30,979 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 9993 transitions. Word has length 299 [2025-03-16 19:05:30,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:30,979 INFO L471 AbstractCegarLoop]: Abstraction has 7658 states and 9993 transitions. [2025-03-16 19:05:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.642857142857142) internal successors, (149), 13 states have internal predecessors, (149), 6 states have call successors, (40), 4 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2025-03-16 19:05:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 9993 transitions. [2025-03-16 19:05:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 19:05:30,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:30,983 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 19:05:30,990 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-16 19:05:31,187 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,SelfDestructingSolverStorable35 [2025-03-16 19:05:31,187 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:31,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash 250594672, now seen corresponding path program 1 times [2025-03-16 19:05:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:31,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884143878] [2025-03-16 19:05:31,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:31,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:31,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 19:05:31,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 19:05:31,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:31,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2025-03-16 19:05:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:31,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884143878] [2025-03-16 19:05:31,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884143878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:31,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:31,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:31,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4021477] [2025-03-16 19:05:31,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:31,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:31,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:31,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:31,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:31,338 INFO L87 Difference]: Start difference. First operand 7658 states and 9993 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-16 19:05:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:32,018 INFO L93 Difference]: Finished difference Result 16100 states and 20977 transitions. [2025-03-16 19:05:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:32,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 299 [2025-03-16 19:05:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:32,048 INFO L225 Difference]: With dead ends: 16100 [2025-03-16 19:05:32,048 INFO L226 Difference]: Without dead ends: 9221 [2025-03-16 19:05:32,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:05:32,060 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 554 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:32,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 794 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9221 states. [2025-03-16 19:05:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9221 to 7131. [2025-03-16 19:05:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7131 states, 5438 states have (on average 1.2999264435454212) internal successors, (7069), 5599 states have internal predecessors, (7069), 1129 states have call successors, (1129), 564 states have call predecessors, (1129), 563 states have return successors, (1128), 974 states have call predecessors, (1128), 1128 states have call successors, (1128) [2025-03-16 19:05:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 9326 transitions. [2025-03-16 19:05:32,452 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 9326 transitions. Word has length 299 [2025-03-16 19:05:32,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:32,452 INFO L471 AbstractCegarLoop]: Abstraction has 7131 states and 9326 transitions. [2025-03-16 19:05:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-16 19:05:32,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 9326 transitions. [2025-03-16 19:05:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-16 19:05:32,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:32,455 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:32,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:05:32,455 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -809604821, now seen corresponding path program 1 times [2025-03-16 19:05:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971764224] [2025-03-16 19:05:32,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:32,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-16 19:05:32,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-16 19:05:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:32,556 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2025-03-16 19:05:32,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971764224] [2025-03-16 19:05:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971764224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:32,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:32,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785285012] [2025-03-16 19:05:32,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:32,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:32,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:32,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:32,559 INFO L87 Difference]: Start difference. First operand 7131 states and 9326 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 19:05:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:33,008 INFO L93 Difference]: Finished difference Result 13030 states and 17060 transitions. [2025-03-16 19:05:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:33,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 306 [2025-03-16 19:05:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:33,032 INFO L225 Difference]: With dead ends: 13030 [2025-03-16 19:05:33,032 INFO L226 Difference]: Without dead ends: 6674 [2025-03-16 19:05:33,042 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-16 19:05:33,042 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 427 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:33,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 909 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6674 states. [2025-03-16 19:05:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6674 to 6420. [2025-03-16 19:05:33,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6420 states, 4900 states have (on average 1.28) internal successors, (6272), 5039 states have internal predecessors, (6272), 1010 states have call successors, (1010), 509 states have call predecessors, (1010), 509 states have return successors, (1010), 871 states have call predecessors, (1010), 1010 states have call successors, (1010) [2025-03-16 19:05:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6420 states to 6420 states and 8292 transitions. [2025-03-16 19:05:33,329 INFO L78 Accepts]: Start accepts. Automaton has 6420 states and 8292 transitions. Word has length 306 [2025-03-16 19:05:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:33,330 INFO L471 AbstractCegarLoop]: Abstraction has 6420 states and 8292 transitions. [2025-03-16 19:05:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-16 19:05:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 6420 states and 8292 transitions. [2025-03-16 19:05:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 19:05:33,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:33,338 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-03-16 19:05:33,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:05:33,338 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:33,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:33,339 INFO L85 PathProgramCache]: Analyzing trace with hash 440288979, now seen corresponding path program 1 times [2025-03-16 19:05:33,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:33,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378676337] [2025-03-16 19:05:33,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:33,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:33,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 19:05:33,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 19:05:33,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:33,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2025-03-16 19:05:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:33,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378676337] [2025-03-16 19:05:33,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378676337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:33,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:33,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:05:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164787359] [2025-03-16 19:05:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:33,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:33,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:33,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:33,968 INFO L87 Difference]: Start difference. First operand 6420 states and 8292 transitions. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 6 states have internal predecessors, (99), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 19:05:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:34,436 INFO L93 Difference]: Finished difference Result 14809 states and 19006 transitions. [2025-03-16 19:05:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:05:34,437 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 6 states have internal predecessors, (99), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 354 [2025-03-16 19:05:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:34,469 INFO L225 Difference]: With dead ends: 14809 [2025-03-16 19:05:34,470 INFO L226 Difference]: Without dead ends: 9172 [2025-03-16 19:05:34,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:05:34,483 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 76 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:34,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1737 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:34,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9172 states. [2025-03-16 19:05:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9172 to 8492. [2025-03-16 19:05:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8492 states, 6468 states have (on average 1.2677798392084105) internal successors, (8200), 6643 states have internal predecessors, (8200), 1278 states have call successors, (1278), 677 states have call predecessors, (1278), 745 states have return successors, (1378), 1171 states have call predecessors, (1378), 1278 states have call successors, (1378) [2025-03-16 19:05:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8492 states to 8492 states and 10856 transitions. [2025-03-16 19:05:34,867 INFO L78 Accepts]: Start accepts. Automaton has 8492 states and 10856 transitions. Word has length 354 [2025-03-16 19:05:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 8492 states and 10856 transitions. [2025-03-16 19:05:34,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 6 states have internal predecessors, (99), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-16 19:05:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8492 states and 10856 transitions. [2025-03-16 19:05:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 19:05:34,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:34,878 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-03-16 19:05:34,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:05:34,878 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:34,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:34,878 INFO L85 PathProgramCache]: Analyzing trace with hash 243775474, now seen corresponding path program 1 times [2025-03-16 19:05:34,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:34,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122452298] [2025-03-16 19:05:34,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:34,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 19:05:34,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 19:05:34,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:34,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2025-03-16 19:05:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122452298] [2025-03-16 19:05:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122452298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587831178] [2025-03-16 19:05:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:34,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:34,981 INFO L87 Difference]: Start difference. First operand 8492 states and 10856 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 19:05:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:35,553 INFO L93 Difference]: Finished difference Result 17162 states and 21896 transitions. [2025-03-16 19:05:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:35,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 354 [2025-03-16 19:05:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:35,592 INFO L225 Difference]: With dead ends: 17162 [2025-03-16 19:05:35,592 INFO L226 Difference]: Without dead ends: 8220 [2025-03-16 19:05:35,607 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-16 19:05:35,608 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 26 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:35,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 667 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8220 states. [2025-03-16 19:05:35,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8220 to 8220. [2025-03-16 19:05:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8220 states, 6264 states have (on average 1.2287675606641124) internal successors, (7697), 6439 states have internal predecessors, (7697), 1278 states have call successors, (1278), 677 states have call predecessors, (1278), 677 states have return successors, (1278), 1103 states have call predecessors, (1278), 1278 states have call successors, (1278) [2025-03-16 19:05:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8220 states to 8220 states and 10253 transitions. [2025-03-16 19:05:36,033 INFO L78 Accepts]: Start accepts. Automaton has 8220 states and 10253 transitions. Word has length 354 [2025-03-16 19:05:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:36,034 INFO L471 AbstractCegarLoop]: Abstraction has 8220 states and 10253 transitions. [2025-03-16 19:05:36,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-16 19:05:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states and 10253 transitions. [2025-03-16 19:05:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 19:05:36,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:36,044 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 19:05:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:05:36,044 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:36,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash -372904070, now seen corresponding path program 1 times [2025-03-16 19:05:36,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:36,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770310307] [2025-03-16 19:05:36,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:36,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 19:05:36,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 19:05:36,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-16 19:05:36,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770310307] [2025-03-16 19:05:36,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770310307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:36,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828781060] [2025-03-16 19:05:36,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:36,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:36,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:36,521 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-16 19:05:36,523 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-16 19:05:36,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 19:05:36,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 19:05:36,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:36,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:36,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 19:05:36,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 302 proven. 72 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-16 19:05:37,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-16 19:05:37,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828781060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:37,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:37,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 12] total 21 [2025-03-16 19:05:37,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589188659] [2025-03-16 19:05:37,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:37,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:05:37,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:37,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:05:37,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:05:37,879 INFO L87 Difference]: Start difference. First operand 8220 states and 10253 transitions. Second operand has 21 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) [2025-03-16 19:05:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:44,081 INFO L93 Difference]: Finished difference Result 54081 states and 72508 transitions. [2025-03-16 19:05:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-16 19:05:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) Word has length 364 [2025-03-16 19:05:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:44,243 INFO L225 Difference]: With dead ends: 54081 [2025-03-16 19:05:44,243 INFO L226 Difference]: Without dead ends: 46716 [2025-03-16 19:05:44,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 739 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3988 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1586, Invalid=9544, Unknown=0, NotChecked=0, Total=11130 [2025-03-16 19:05:44,272 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 5620 mSDsluCounter, 7375 mSDsCounter, 0 mSdLazyCounter, 3901 mSolverCounterSat, 1761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5620 SdHoareTripleChecker+Valid, 8146 SdHoareTripleChecker+Invalid, 5662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1761 IncrementalHoareTripleChecker+Valid, 3901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:44,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5620 Valid, 8146 Invalid, 5662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1761 Valid, 3901 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 19:05:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46716 states. [2025-03-16 19:05:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46716 to 9019. [2025-03-16 19:05:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9019 states, 6892 states have (on average 1.2315728380731283) internal successors, (8488), 7150 states have internal predecessors, (8488), 1384 states have call successors, (1384), 742 states have call predecessors, (1384), 742 states have return successors, (1384), 1126 states have call predecessors, (1384), 1384 states have call successors, (1384) [2025-03-16 19:05:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9019 states to 9019 states and 11256 transitions. [2025-03-16 19:05:45,523 INFO L78 Accepts]: Start accepts. Automaton has 9019 states and 11256 transitions. Word has length 364 [2025-03-16 19:05:45,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:45,524 INFO L471 AbstractCegarLoop]: Abstraction has 9019 states and 11256 transitions. [2025-03-16 19:05:45,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 13.0) internal successors, (260), 20 states have internal predecessors, (260), 14 states have call successors, (64), 7 states have call predecessors, (64), 6 states have return successors, (62), 13 states have call predecessors, (62), 13 states have call successors, (62) [2025-03-16 19:05:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9019 states and 11256 transitions. [2025-03-16 19:05:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 19:05:45,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:45,536 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:05:45,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:45,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-16 19:05:45,740 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash -271992103, now seen corresponding path program 1 times [2025-03-16 19:05:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756528214] [2025-03-16 19:05:45,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:45,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 19:05:45,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 19:05:45,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:45,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2025-03-16 19:05:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756528214] [2025-03-16 19:05:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756528214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:05:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858709428] [2025-03-16 19:05:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:45,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:45,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:45,991 INFO L87 Difference]: Start difference. First operand 9019 states and 11256 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-16 19:05:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:46,851 INFO L93 Difference]: Finished difference Result 17509 states and 22000 transitions. [2025-03-16 19:05:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:05:46,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 364 [2025-03-16 19:05:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:46,874 INFO L225 Difference]: With dead ends: 17509 [2025-03-16 19:05:46,874 INFO L226 Difference]: Without dead ends: 9453 [2025-03-16 19:05:46,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:05:46,884 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 155 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:46,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 2283 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:46,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9453 states. [2025-03-16 19:05:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9453 to 8211. [2025-03-16 19:05:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8211 states, 6264 states have (on average 1.2318007662835249) internal successors, (7716), 6526 states have internal predecessors, (7716), 1268 states have call successors, (1268), 678 states have call predecessors, (1268), 678 states have return successors, (1268), 1006 states have call predecessors, (1268), 1268 states have call successors, (1268) [2025-03-16 19:05:47,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 10252 transitions. [2025-03-16 19:05:47,901 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 10252 transitions. Word has length 364 [2025-03-16 19:05:47,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 8211 states and 10252 transitions. [2025-03-16 19:05:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-16 19:05:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 10252 transitions. [2025-03-16 19:05:47,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-16 19:05:47,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:47,915 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:47,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:05:47,915 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:47,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -465742712, now seen corresponding path program 1 times [2025-03-16 19:05:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:47,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152445434] [2025-03-16 19:05:47,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-16 19:05:47,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-16 19:05:47,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:47,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-16 19:05:48,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152445434] [2025-03-16 19:05:48,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152445434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:48,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930864327] [2025-03-16 19:05:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:48,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:48,706 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:05:48,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 19:05:48,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-16 19:05:48,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-16 19:05:48,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:48,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:48,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 19:05:48,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 302 proven. 70 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-03-16 19:05:49,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-16 19:05:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930864327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:49,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 28 [2025-03-16 19:05:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915106008] [2025-03-16 19:05:49,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:49,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:05:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:49,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:05:49,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:05:49,806 INFO L87 Difference]: Start difference. First operand 8211 states and 10252 transitions. Second operand has 28 states, 27 states have (on average 10.88888888888889) internal successors, (294), 27 states have internal predecessors, (294), 18 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 17 states have call predecessors, (74), 17 states have call successors, (74) [2025-03-16 19:06:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:04,240 INFO L93 Difference]: Finished difference Result 62543 states and 83884 transitions. [2025-03-16 19:06:04,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2025-03-16 19:06:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 10.88888888888889) internal successors, (294), 27 states have internal predecessors, (294), 18 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 17 states have call predecessors, (74), 17 states have call successors, (74) Word has length 365 [2025-03-16 19:06:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:04,528 INFO L225 Difference]: With dead ends: 62543 [2025-03-16 19:06:04,529 INFO L226 Difference]: Without dead ends: 55295 [2025-03-16 19:06:04,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17657 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5557, Invalid=37499, Unknown=0, NotChecked=0, Total=43056 [2025-03-16 19:06:04,565 INFO L435 NwaCegarLoop]: 992 mSDtfsCounter, 7662 mSDsluCounter, 10694 mSDsCounter, 0 mSdLazyCounter, 5953 mSolverCounterSat, 2521 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7662 SdHoareTripleChecker+Valid, 11686 SdHoareTripleChecker+Invalid, 8474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2521 IncrementalHoareTripleChecker+Valid, 5953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7662 Valid, 11686 Invalid, 8474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2521 Valid, 5953 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 19:06:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55295 states. [2025-03-16 19:06:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55295 to 9402. [2025-03-16 19:06:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9402 states, 7254 states have (on average 1.2420733388475325) internal successors, (9010), 7582 states have internal predecessors, (9010), 1391 states have call successors, (1391), 756 states have call predecessors, (1391), 756 states have return successors, (1391), 1063 states have call predecessors, (1391), 1391 states have call successors, (1391) [2025-03-16 19:06:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9402 states to 9402 states and 11792 transitions. [2025-03-16 19:06:06,658 INFO L78 Accepts]: Start accepts. Automaton has 9402 states and 11792 transitions. Word has length 365 [2025-03-16 19:06:06,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:06,658 INFO L471 AbstractCegarLoop]: Abstraction has 9402 states and 11792 transitions. [2025-03-16 19:06:06,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 10.88888888888889) internal successors, (294), 27 states have internal predecessors, (294), 18 states have call successors, (76), 7 states have call predecessors, (76), 6 states have return successors, (74), 17 states have call predecessors, (74), 17 states have call successors, (74) [2025-03-16 19:06:06,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9402 states and 11792 transitions. [2025-03-16 19:06:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-16 19:06:06,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:06,671 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:06:06,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 19:06:06,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-16 19:06:06,871 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 492449321, now seen corresponding path program 1 times [2025-03-16 19:06:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:06,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215984424] [2025-03-16 19:06:06,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:06,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:06,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-16 19:06:06,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-16 19:06:06,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:06,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 19:06:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215984424] [2025-03-16 19:06:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215984424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:06:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938564208] [2025-03-16 19:06:07,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:06:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:06:07,570 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:06:07,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 19:06:07,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-16 19:06:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-16 19:06:07,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:07,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:07,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-16 19:06:07,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:06:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 260 proven. 115 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-16 19:06:08,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:06:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-03-16 19:06:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938564208] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:06:08,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:06:08,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 35 [2025-03-16 19:06:08,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752584929] [2025-03-16 19:06:08,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:06:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 19:06:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:08,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 19:06:08,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:06:08,750 INFO L87 Difference]: Start difference. First operand 9402 states and 11792 transitions. Second operand has 35 states, 34 states have (on average 8.5) internal successors, (289), 32 states have internal predecessors, (289), 15 states have call successors, (67), 7 states have call predecessors, (67), 9 states have return successors, (66), 16 states have call predecessors, (66), 14 states have call successors, (66)