./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.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.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:04:58,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:04:58,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:04:58,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:04:58,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:04:58,896 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:04:58,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:04:58,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:04:58,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:04:58,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:04:58,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:04:58,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:04:58,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:04:58,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:04:58,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:04:58,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:04:58,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:04:58,898 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 -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2025-03-16 19:04:59,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:04:59,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:04:59,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:04:59,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:04:59,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:04:59,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:00,242 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0c36f23/e56e8b1a71d6464091325c5c13e95f49/FLAG85a99cadb [2025-03-16 19:05:00,541 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:05:00,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:00,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0c36f23/e56e8b1a71d6464091325c5c13e95f49/FLAG85a99cadb [2025-03-16 19:05:00,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc0c36f23/e56e8b1a71d6464091325c5c13e95f49 [2025-03-16 19:05:00,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:05:00,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:05:00,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:00,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:05:00,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:05:00,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:00" (1/1) ... [2025-03-16 19:05:00,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319a484b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:00, skipping insertion in model container [2025-03-16 19:05:00,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:05:00" (1/1) ... [2025-03-16 19:05:00,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:05:00,979 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.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-03-16 19:05:00,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:00,988 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:05:01,029 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.2.ufo.BOUNDED-10.pals.c[11857,11870] [2025-03-16 19:05:01,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:05:01,041 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:05:01,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:01 WrapperNode [2025-03-16 19:05:01,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:05:01,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:01,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:05:01,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:05:01,048 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:01" (1/1) ... [2025-03-16 19:05:01,057 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:01" (1/1) ... [2025-03-16 19:05:01,086 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 421 [2025-03-16 19:05:01,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:05:01,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:05:01,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:05:01,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:05:01,097 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:01" (1/1) ... [2025-03-16 19:05:01,097 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:01" (1/1) ... [2025-03-16 19:05:01,106 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:01" (1/1) ... [2025-03-16 19:05:01,124 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:01,128 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:01" (1/1) ... [2025-03-16 19:05:01,128 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:01" (1/1) ... [2025-03-16 19:05:01,138 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:01" (1/1) ... [2025-03-16 19:05:01,139 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:01" (1/1) ... [2025-03-16 19:05:01,144 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:01" (1/1) ... [2025-03-16 19:05:01,145 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:01" (1/1) ... [2025-03-16 19:05:01,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:05:01,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:05:01,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:05:01,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:05:01,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:01" (1/1) ... [2025-03-16 19:05:01,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:05:01,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:01,182 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:01,184 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:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:05:01,203 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:05:01,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:05:01,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:05:01,290 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:05:01,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:05:01,713 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-16 19:05:01,714 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:05:01,723 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:05:01,724 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:05:01,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:01 BoogieIcfgContainer [2025-03-16 19:05:01,724 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:05:01,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:05:01,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:05:01,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:05:01,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:05:00" (1/3) ... [2025-03-16 19:05:01,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fb853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:01, skipping insertion in model container [2025-03-16 19:05:01,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:05:01" (2/3) ... [2025-03-16 19:05:01,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388fb853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:05:01, skipping insertion in model container [2025-03-16 19:05:01,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:05:01" (3/3) ... [2025-03-16 19:05:01,731 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2025-03-16 19:05:01,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:05:01,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c that has 6 procedures, 169 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 19:05:01,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:05:01,801 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;@514ba7eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:05:01,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:05:01,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 169 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 134 states have internal predecessors, (209), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 19:05:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 19:05:01,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:01,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:01,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1947377585, now seen corresponding path program 1 times [2025-03-16 19:05:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554047449] [2025-03-16 19:05:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:01,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:01,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 19:05:01,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 19:05:01,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:01,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:02,101 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:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:02,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554047449] [2025-03-16 19:05:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554047449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:02,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:02,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428166528] [2025-03-16 19:05:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:02,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:02,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:02,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:02,125 INFO L87 Difference]: Start difference. First operand has 169 states, 130 states have (on average 1.6076923076923078) internal successors, (209), 134 states have internal predecessors, (209), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) 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:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:02,211 INFO L93 Difference]: Finished difference Result 342 states and 583 transitions. [2025-03-16 19:05:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:02,215 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:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:02,221 INFO L225 Difference]: With dead ends: 342 [2025-03-16 19:05:02,221 INFO L226 Difference]: Without dead ends: 173 [2025-03-16 19:05:02,224 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:02,226 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 773 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:02,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 773 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:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-16 19:05:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-16 19:05:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 134 states have (on average 1.5522388059701493) internal successors, (208), 137 states have internal predecessors, (208), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-16 19:05:02,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 272 transitions. [2025-03-16 19:05:02,276 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 272 transitions. Word has length 14 [2025-03-16 19:05:02,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:02,277 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 272 transitions. [2025-03-16 19:05:02,277 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:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 272 transitions. [2025-03-16 19:05:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 19:05:02,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:02,278 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:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:05:02,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:02,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2045025917, now seen corresponding path program 1 times [2025-03-16 19:05:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818006092] [2025-03-16 19:05:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:02,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 19:05:02,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 19:05:02,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:02,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:02,360 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:02,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818006092] [2025-03-16 19:05:02,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818006092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:02,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200305272] [2025-03-16 19:05:02,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:02,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:02,366 INFO L87 Difference]: Start difference. First operand 173 states and 272 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:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:02,425 INFO L93 Difference]: Finished difference Result 358 states and 566 transitions. [2025-03-16 19:05:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:02,425 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:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:02,429 INFO L225 Difference]: With dead ends: 358 [2025-03-16 19:05:02,430 INFO L226 Difference]: Without dead ends: 187 [2025-03-16 19:05:02,431 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:02,433 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 22 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 785 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:02,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 785 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:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-16 19:05:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-03-16 19:05:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 144 states have (on average 1.5347222222222223) internal successors, (221), 147 states have internal predecessors, (221), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2025-03-16 19:05:02,451 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 15 [2025-03-16 19:05:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2025-03-16 19:05:02,452 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:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2025-03-16 19:05:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 19:05:02,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:02,453 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] [2025-03-16 19:05:02,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:05:02,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1042299218, now seen corresponding path program 1 times [2025-03-16 19:05:02,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:02,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113360791] [2025-03-16 19:05:02,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:02,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 19:05:02,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 19:05:02,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:02,537 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:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113360791] [2025-03-16 19:05:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113360791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:02,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036774211] [2025-03-16 19:05:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:02,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:02,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:02,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:02,541 INFO L87 Difference]: Start difference. First operand 185 states and 287 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:02,562 INFO L93 Difference]: Finished difference Result 390 states and 612 transitions. [2025-03-16 19:05:02,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:02,563 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-03-16 19:05:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:02,565 INFO L225 Difference]: With dead ends: 390 [2025-03-16 19:05:02,565 INFO L226 Difference]: Without dead ends: 214 [2025-03-16 19:05:02,566 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:02,566 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 22 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 530 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:02,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 530 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:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-16 19:05:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 187. [2025-03-16 19:05:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5273972602739727) internal successors, (223), 149 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 289 transitions. [2025-03-16 19:05:02,606 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 289 transitions. Word has length 21 [2025-03-16 19:05:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:02,606 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 289 transitions. [2025-03-16 19:05:02,606 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 19:05:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 289 transitions. [2025-03-16 19:05:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 19:05:02,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:02,609 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] [2025-03-16 19:05:02,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:05:02,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:02,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2040289052, now seen corresponding path program 1 times [2025-03-16 19:05:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781638814] [2025-03-16 19:05:02,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:02,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 19:05:02,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 19:05:02,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:02,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:02,722 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:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781638814] [2025-03-16 19:05:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781638814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952303577] [2025-03-16 19:05:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:02,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:02,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:02,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:02,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:02,724 INFO L87 Difference]: Start difference. First operand 187 states and 289 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:02,772 INFO L93 Difference]: Finished difference Result 421 states and 666 transitions. [2025-03-16 19:05:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:02,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-16 19:05:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:02,777 INFO L225 Difference]: With dead ends: 421 [2025-03-16 19:05:02,777 INFO L226 Difference]: Without dead ends: 282 [2025-03-16 19:05:02,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:02,778 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 116 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:02,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 777 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-16 19:05:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 187. [2025-03-16 19:05:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.5) internal successors, (219), 149 states have internal predecessors, (219), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2025-03-16 19:05:02,793 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 30 [2025-03-16 19:05:02,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:02,793 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2025-03-16 19:05:02,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 19:05:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2025-03-16 19:05:02,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 19:05:02,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:02,794 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:02,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:05:02,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:02,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1379783113, now seen corresponding path program 1 times [2025-03-16 19:05:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542068041] [2025-03-16 19:05:02,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:02,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:02,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 19:05:02,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 19:05:02,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:02,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:02,865 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:02,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542068041] [2025-03-16 19:05:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542068041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:02,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:02,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:02,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638320619] [2025-03-16 19:05:02,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:02,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:02,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:02,866 INFO L87 Difference]: Start difference. First operand 187 states and 285 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:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:02,900 INFO L93 Difference]: Finished difference Result 366 states and 561 transitions. [2025-03-16 19:05:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:02,901 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:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:02,903 INFO L225 Difference]: With dead ends: 366 [2025-03-16 19:05:02,904 INFO L226 Difference]: Without dead ends: 189 [2025-03-16 19:05:02,904 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:02,905 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 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:02,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 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:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-16 19:05:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2025-03-16 19:05:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.4931506849315068) internal successors, (218), 149 states have internal predecessors, (218), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-16 19:05:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 284 transitions. [2025-03-16 19:05:02,918 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 284 transitions. Word has length 31 [2025-03-16 19:05:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 284 transitions. [2025-03-16 19:05:02,918 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:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 284 transitions. [2025-03-16 19:05:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 19:05:02,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:02,921 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:02,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:05:02,922 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash -154825079, now seen corresponding path program 1 times [2025-03-16 19:05:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274503274] [2025-03-16 19:05:02,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:02,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:02,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:02,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,011 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:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274503274] [2025-03-16 19:05:03,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274503274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:03,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29298845] [2025-03-16 19:05:03,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:03,015 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:03,016 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:03,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 19:05:03,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 19:05:03,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:03,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:03,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:03,135 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:03,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:03,168 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:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29298845] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:03,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 19:05:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463946082] [2025-03-16 19:05:03,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:03,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:03,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:03,170 INFO L87 Difference]: Start difference. First operand 187 states and 284 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:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:03,214 INFO L93 Difference]: Finished difference Result 423 states and 656 transitions. [2025-03-16 19:05:03,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:03,217 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:03,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:03,219 INFO L225 Difference]: With dead ends: 423 [2025-03-16 19:05:03,220 INFO L226 Difference]: Without dead ends: 246 [2025-03-16 19:05:03,220 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:03,221 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 76 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:03,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 793 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-16 19:05:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2025-03-16 19:05:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 189 states have (on average 1.4656084656084656) internal successors, (277), 192 states have internal predecessors, (277), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 363 transitions. [2025-03-16 19:05:03,238 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 363 transitions. Word has length 33 [2025-03-16 19:05:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:03,238 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 363 transitions. [2025-03-16 19:05:03,238 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:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 363 transitions. [2025-03-16 19:05:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:03,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:03,241 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:03,248 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:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 19:05:03,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 504616777, now seen corresponding path program 2 times [2025-03-16 19:05:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6442324] [2025-03-16 19:05:03,447 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 19:05:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:03,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-16 19:05:03,467 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:03,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-16 19:05:03,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,507 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:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6442324] [2025-03-16 19:05:03,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6442324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:03,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:03,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765695654] [2025-03-16 19:05:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:03,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:03,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:03,509 INFO L87 Difference]: Start difference. First operand 240 states and 363 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:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:03,555 INFO L93 Difference]: Finished difference Result 460 states and 712 transitions. [2025-03-16 19:05:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:03,556 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:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:03,559 INFO L225 Difference]: With dead ends: 460 [2025-03-16 19:05:03,559 INFO L226 Difference]: Without dead ends: 247 [2025-03-16 19:05:03,560 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:03,560 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 8 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 757 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:03,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 757 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:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-16 19:05:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-16 19:05:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 198 states have internal predecessors, (285), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-16 19:05:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 371 transitions. [2025-03-16 19:05:03,578 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 371 transitions. Word has length 55 [2025-03-16 19:05:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 371 transitions. [2025-03-16 19:05:03,579 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:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 371 transitions. [2025-03-16 19:05:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 19:05:03,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:03,579 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:03,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:05:03,580 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:03,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2065837965, now seen corresponding path program 1 times [2025-03-16 19:05:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971657429] [2025-03-16 19:05:03,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:03,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 19:05:03,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 19:05:03,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:03,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,669 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:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971657429] [2025-03-16 19:05:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971657429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:03,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:03,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98722822] [2025-03-16 19:05:03,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:03,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:03,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:03,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:03,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:03,671 INFO L87 Difference]: Start difference. First operand 247 states and 371 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:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:03,712 INFO L93 Difference]: Finished difference Result 504 states and 768 transitions. [2025-03-16 19:05:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:03,716 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:03,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:03,718 INFO L225 Difference]: With dead ends: 504 [2025-03-16 19:05:03,718 INFO L226 Difference]: Without dead ends: 284 [2025-03-16 19:05:03,719 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:03,719 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 22 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 772 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:03,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 772 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:03,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-16 19:05:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2025-03-16 19:05:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 226 states have (on average 1.420353982300885) internal successors, (321), 229 states have internal predecessors, (321), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2025-03-16 19:05:03,736 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 55 [2025-03-16 19:05:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:03,736 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2025-03-16 19:05:03,736 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:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2025-03-16 19:05:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:05:03,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:03,738 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:03,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:05:03,738 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:03,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:03,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1015812564, now seen corresponding path program 1 times [2025-03-16 19:05:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073464013] [2025-03-16 19:05:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:05:03,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:05:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:03,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,855 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:03,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:03,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073464013] [2025-03-16 19:05:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073464013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:03,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359946638] [2025-03-16 19:05:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:03,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:03,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:03,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:03,857 INFO L87 Difference]: Start difference. First operand 282 states and 413 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:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:03,884 INFO L93 Difference]: Finished difference Result 516 states and 768 transitions. [2025-03-16 19:05:03,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:03,885 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:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:03,886 INFO L225 Difference]: With dead ends: 516 [2025-03-16 19:05:03,886 INFO L226 Difference]: Without dead ends: 284 [2025-03-16 19:05:03,887 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:03,888 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1033 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:03,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1033 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:03,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-03-16 19:05:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2025-03-16 19:05:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 226 states have (on average 1.407079646017699) internal successors, (318), 229 states have internal predecessors, (318), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-16 19:05:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 410 transitions. [2025-03-16 19:05:03,904 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 410 transitions. Word has length 73 [2025-03-16 19:05:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 410 transitions. [2025-03-16 19:05:03,904 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:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 410 transitions. [2025-03-16 19:05:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:05:03,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:03,905 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:03,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:05:03,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:03,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 485389940, now seen corresponding path program 1 times [2025-03-16 19:05:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:03,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132663177] [2025-03-16 19:05:03,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:03,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:05:03,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:05:03,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:03,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:03,991 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:03,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132663177] [2025-03-16 19:05:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132663177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:03,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:03,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031001041] [2025-03-16 19:05:03,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:03,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:03,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:03,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:03,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:03,992 INFO L87 Difference]: Start difference. First operand 282 states and 410 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:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,038 INFO L93 Difference]: Finished difference Result 551 states and 822 transitions. [2025-03-16 19:05:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:04,038 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:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,041 INFO L225 Difference]: With dead ends: 551 [2025-03-16 19:05:04,041 INFO L226 Difference]: Without dead ends: 324 [2025-03-16 19:05:04,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:04,043 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 23 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 772 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:04,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 772 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:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-16 19:05:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2025-03-16 19:05:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 265 states have internal predecessors, (359), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-16 19:05:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 457 transitions. [2025-03-16 19:05:04,063 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 457 transitions. Word has length 101 [2025-03-16 19:05:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,063 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 457 transitions. [2025-03-16 19:05:04,063 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:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 457 transitions. [2025-03-16 19:05:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:05:04,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,064 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:04,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:05:04,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -781087350, now seen corresponding path program 1 times [2025-03-16 19:05:04,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139538614] [2025-03-16 19:05:04,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:05:04,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:05:04,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:04,167 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:04,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:04,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139538614] [2025-03-16 19:05:04,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139538614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:04,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:04,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270978248] [2025-03-16 19:05:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:04,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:04,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:04,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:04,169 INFO L87 Difference]: Start difference. First operand 322 states and 457 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:04,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,214 INFO L93 Difference]: Finished difference Result 577 states and 842 transitions. [2025-03-16 19:05:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:04,214 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:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,217 INFO L225 Difference]: With dead ends: 577 [2025-03-16 19:05:04,217 INFO L226 Difference]: Without dead ends: 316 [2025-03-16 19:05:04,219 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:04,219 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 9 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 740 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:04,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 740 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:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-16 19:05:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-03-16 19:05:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.350194552529183) internal successors, (347), 260 states have internal predecessors, (347), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2025-03-16 19:05:04,237 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 102 [2025-03-16 19:05:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,238 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2025-03-16 19:05:04,238 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:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2025-03-16 19:05:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:05:04,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,240 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:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:05:04,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 212065384, now seen corresponding path program 1 times [2025-03-16 19:05:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828829994] [2025-03-16 19:05:04,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:05:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:05:04,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:04,344 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:04,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:04,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828829994] [2025-03-16 19:05:04,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828829994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:04,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:04,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:04,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037565496] [2025-03-16 19:05:04,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:04,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:04,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:04,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:04,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:04,346 INFO L87 Difference]: Start difference. First operand 316 states and 443 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:04,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,376 INFO L93 Difference]: Finished difference Result 553 states and 792 transitions. [2025-03-16 19:05:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:04,376 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:04,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,379 INFO L225 Difference]: With dead ends: 553 [2025-03-16 19:05:04,379 INFO L226 Difference]: Without dead ends: 318 [2025-03-16 19:05:04,380 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:04,380 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1017 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:04,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1017 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:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-16 19:05:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-03-16 19:05:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.33852140077821) internal successors, (344), 260 states have internal predecessors, (344), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-16 19:05:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 440 transitions. [2025-03-16 19:05:04,394 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 440 transitions. Word has length 121 [2025-03-16 19:05:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,395 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 440 transitions. [2025-03-16 19:05:04,395 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:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 440 transitions. [2025-03-16 19:05:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-16 19:05:04,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,396 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:04,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:05:04,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1641667048, now seen corresponding path program 1 times [2025-03-16 19:05:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211244347] [2025-03-16 19:05:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-16 19:05:04,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-16 19:05:04,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:04,505 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:04,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211244347] [2025-03-16 19:05:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211244347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:04,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390780958] [2025-03-16 19:05:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:04,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:04,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:04,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:04,507 INFO L87 Difference]: Start difference. First operand 316 states and 440 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:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,564 INFO L93 Difference]: Finished difference Result 516 states and 752 transitions. [2025-03-16 19:05:04,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:04,565 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:04,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,567 INFO L225 Difference]: With dead ends: 516 [2025-03-16 19:05:04,567 INFO L226 Difference]: Without dead ends: 314 [2025-03-16 19:05:04,568 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:04,568 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 7 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 708 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:04,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 708 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:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-16 19:05:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-16 19:05:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 256 states have (on average 1.3359375) internal successors, (342), 259 states have internal predecessors, (342), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-16 19:05:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 436 transitions. [2025-03-16 19:05:04,584 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 436 transitions. Word has length 153 [2025-03-16 19:05:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,585 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 436 transitions. [2025-03-16 19:05:04,585 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:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 436 transitions. [2025-03-16 19:05:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-16 19:05:04,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,587 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] [2025-03-16 19:05:04,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:05:04,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,588 INFO L85 PathProgramCache]: Analyzing trace with hash 598608072, now seen corresponding path program 1 times [2025-03-16 19:05:04,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170446465] [2025-03-16 19:05:04,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-16 19:05:04,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-16 19:05:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:04,724 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:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170446465] [2025-03-16 19:05:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170446465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:04,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:04,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:04,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130683574] [2025-03-16 19:05:04,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:04,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:04,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:04,725 INFO L87 Difference]: Start difference. First operand 314 states and 436 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,773 INFO L93 Difference]: Finished difference Result 456 states and 648 transitions. [2025-03-16 19:05:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 168 [2025-03-16 19:05:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,775 INFO L225 Difference]: With dead ends: 456 [2025-03-16 19:05:04,775 INFO L226 Difference]: Without dead ends: 297 [2025-03-16 19:05:04,776 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:04,776 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 32 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 685 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:04,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 685 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:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-16 19:05:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-03-16 19:05:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 242 states have (on average 1.3264462809917354) internal successors, (321), 245 states have internal predecessors, (321), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-16 19:05:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 409 transitions. [2025-03-16 19:05:04,787 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 409 transitions. Word has length 168 [2025-03-16 19:05:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,788 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 409 transitions. [2025-03-16 19:05:04,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:04,788 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 409 transitions. [2025-03-16 19:05:04,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-16 19:05:04,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,789 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] [2025-03-16 19:05:04,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:05:04,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,790 INFO L85 PathProgramCache]: Analyzing trace with hash 54413683, now seen corresponding path program 1 times [2025-03-16 19:05:04,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517686361] [2025-03-16 19:05:04,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-16 19:05:04,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-16 19:05:04,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:04,889 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:04,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:04,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517686361] [2025-03-16 19:05:04,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517686361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:04,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:04,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28395628] [2025-03-16 19:05:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:04,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:04,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:04,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:04,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:04,892 INFO L87 Difference]: Start difference. First operand 297 states and 409 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:04,954 INFO L93 Difference]: Finished difference Result 439 states and 621 transitions. [2025-03-16 19:05:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 170 [2025-03-16 19:05:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:04,956 INFO L225 Difference]: With dead ends: 439 [2025-03-16 19:05:04,956 INFO L226 Difference]: Without dead ends: 278 [2025-03-16 19:05:04,957 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:04,957 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 28 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 688 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:04,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 688 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:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-16 19:05:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-16 19:05:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.3185840707964602) internal successors, (298), 229 states have internal predecessors, (298), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-16 19:05:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 380 transitions. [2025-03-16 19:05:04,971 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 380 transitions. Word has length 170 [2025-03-16 19:05:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:04,973 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 380 transitions. [2025-03-16 19:05:04,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 19:05:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 380 transitions. [2025-03-16 19:05:04,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 19:05:04,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:04,974 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] [2025-03-16 19:05:04,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:05:04,975 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:04,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1378983062, now seen corresponding path program 1 times [2025-03-16 19:05:04,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:04,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606271713] [2025-03-16 19:05:04,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:04,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 19:05:04,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 19:05:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:05,084 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:05,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:05,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606271713] [2025-03-16 19:05:05,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606271713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:05:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270899966] [2025-03-16 19:05:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:05,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:05:05,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:05,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:05:05,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:05,085 INFO L87 Difference]: Start difference. First operand 278 states and 380 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:05,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:05,109 INFO L93 Difference]: Finished difference Result 420 states and 592 transitions. [2025-03-16 19:05:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:05,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 171 [2025-03-16 19:05:05,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:05,111 INFO L225 Difference]: With dead ends: 420 [2025-03-16 19:05:05,111 INFO L226 Difference]: Without dead ends: 278 [2025-03-16 19:05:05,112 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:05,113 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 0 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 995 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:05,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 995 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:05,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-16 19:05:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-03-16 19:05:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.2920353982300885) internal successors, (292), 229 states have internal predecessors, (292), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-16 19:05:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 374 transitions. [2025-03-16 19:05:05,123 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 374 transitions. Word has length 171 [2025-03-16 19:05:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:05,124 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 374 transitions. [2025-03-16 19:05:05,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 374 transitions. [2025-03-16 19:05:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 19:05:05,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:05,126 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] [2025-03-16 19:05:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:05:05,126 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:05,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -533499207, now seen corresponding path program 1 times [2025-03-16 19:05:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509120045] [2025-03-16 19:05:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 19:05:05,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 19:05:05,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:05,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:05,207 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:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:05,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509120045] [2025-03-16 19:05:05,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509120045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:05,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299305673] [2025-03-16 19:05:05,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:05,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:05,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:05,210 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:05,212 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:05,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 19:05:05,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 19:05:05,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:05,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:05,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:05,416 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:05,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:05,528 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:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299305673] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 19:05:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2025-03-16 19:05:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428353244] [2025-03-16 19:05:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:05,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:05,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:05,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:05:05,530 INFO L87 Difference]: Start difference. First operand 278 states and 374 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-16 19:05:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:05,563 INFO L93 Difference]: Finished difference Result 440 states and 613 transitions. [2025-03-16 19:05:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 177 [2025-03-16 19:05:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:05,566 INFO L225 Difference]: With dead ends: 440 [2025-03-16 19:05:05,566 INFO L226 Difference]: Without dead ends: 257 [2025-03-16 19:05:05,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 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:05,566 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 19 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 688 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:05,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 688 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:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-16 19:05:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-03-16 19:05:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 208 states have (on average 1.2836538461538463) internal successors, (267), 211 states have internal predecessors, (267), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 343 transitions. [2025-03-16 19:05:05,576 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 343 transitions. Word has length 177 [2025-03-16 19:05:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:05,576 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 343 transitions. [2025-03-16 19:05:05,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-16 19:05:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 343 transitions. [2025-03-16 19:05:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-16 19:05:05,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:05,577 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] [2025-03-16 19:05:05,585 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:05,782 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:05,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:05,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1511925106, now seen corresponding path program 1 times [2025-03-16 19:05:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:05,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714965873] [2025-03-16 19:05:05,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:05,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-16 19:05:05,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-16 19:05:05,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:05,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:05,872 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:05,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:05,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714965873] [2025-03-16 19:05:05,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714965873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:05,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:05,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769046185] [2025-03-16 19:05:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:05,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:05,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:05,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:05,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:05,873 INFO L87 Difference]: Start difference. First operand 257 states and 343 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:05,902 INFO L93 Difference]: Finished difference Result 396 states and 553 transitions. [2025-03-16 19:05:05,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 201 [2025-03-16 19:05:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:05,904 INFO L225 Difference]: With dead ends: 396 [2025-03-16 19:05:05,905 INFO L226 Difference]: Without dead ends: 261 [2025-03-16 19:05:05,905 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:05,905 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 3 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 728 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:05,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 728 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:05,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-16 19:05:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-03-16 19:05:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 214 states have internal predecessors, (270), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 346 transitions. [2025-03-16 19:05:05,917 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 346 transitions. Word has length 201 [2025-03-16 19:05:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:05,917 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 346 transitions. [2025-03-16 19:05:05,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-16 19:05:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 346 transitions. [2025-03-16 19:05:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 19:05:05,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:05,920 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] [2025-03-16 19:05:05,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:05:05,920 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:05,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:05,920 INFO L85 PathProgramCache]: Analyzing trace with hash 38826555, now seen corresponding path program 1 times [2025-03-16 19:05:05,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:05,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072995396] [2025-03-16 19:05:05,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:05,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:05,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 19:05:05,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 19:05:05,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:05,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:06,031 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:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:06,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072995396] [2025-03-16 19:05:06,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072995396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:06,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:06,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:06,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734312418] [2025-03-16 19:05:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:06,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:06,032 INFO L87 Difference]: Start difference. First operand 261 states and 346 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:06,065 INFO L93 Difference]: Finished difference Result 405 states and 561 transitions. [2025-03-16 19:05:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 208 [2025-03-16 19:05:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:06,067 INFO L225 Difference]: With dead ends: 405 [2025-03-16 19:05:06,068 INFO L226 Difference]: Without dead ends: 266 [2025-03-16 19:05:06,068 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:06,068 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 4 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 730 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:06,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 730 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:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-16 19:05:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-16 19:05:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 215 states have (on average 1.2744186046511627) internal successors, (274), 218 states have internal predecessors, (274), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-16 19:05:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 350 transitions. [2025-03-16 19:05:06,080 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 350 transitions. Word has length 208 [2025-03-16 19:05:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:06,081 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 350 transitions. [2025-03-16 19:05:06,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:06,082 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 350 transitions. [2025-03-16 19:05:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 19:05:06,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:06,083 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] [2025-03-16 19:05:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:05:06,084 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1629188757, now seen corresponding path program 1 times [2025-03-16 19:05:06,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200065223] [2025-03-16 19:05:06,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 19:05:06,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 19:05:06,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:06,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:06,206 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:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200065223] [2025-03-16 19:05:06,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200065223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:06,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520844445] [2025-03-16 19:05:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:06,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:06,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:06,207 INFO L87 Difference]: Start difference. First operand 266 states and 350 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:06,238 INFO L93 Difference]: Finished difference Result 409 states and 561 transitions. [2025-03-16 19:05:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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 216 [2025-03-16 19:05:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:06,242 INFO L225 Difference]: With dead ends: 409 [2025-03-16 19:05:06,242 INFO L226 Difference]: Without dead ends: 265 [2025-03-16 19:05:06,242 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:06,242 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 5 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 720 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:06,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 720 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:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-16 19:05:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-03-16 19:05:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 215 states have (on average 1.2604651162790699) internal successors, (271), 217 states have internal predecessors, (271), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-16 19:05:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 345 transitions. [2025-03-16 19:05:06,255 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 345 transitions. Word has length 216 [2025-03-16 19:05:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:06,256 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 345 transitions. [2025-03-16 19:05:06,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 345 transitions. [2025-03-16 19:05:06,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 19:05:06,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:06,258 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] [2025-03-16 19:05:06,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:05:06,258 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:06,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2081569714, now seen corresponding path program 1 times [2025-03-16 19:05:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:06,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456937727] [2025-03-16 19:05:06,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:06,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:06,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 19:05:06,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 19:05:06,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:06,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:06,374 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:06,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456937727] [2025-03-16 19:05:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456937727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:06,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:06,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122802336] [2025-03-16 19:05:06,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:06,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:06,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:06,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:06,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:06,377 INFO L87 Difference]: Start difference. First operand 265 states and 345 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:06,391 INFO L93 Difference]: Finished difference Result 407 states and 550 transitions. [2025-03-16 19:05:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:06,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2025-03-16 19:05:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:06,395 INFO L225 Difference]: With dead ends: 407 [2025-03-16 19:05:06,395 INFO L226 Difference]: Without dead ends: 264 [2025-03-16 19:05:06,396 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:06,397 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 480 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:06,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 480 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:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-16 19:05:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-16 19:05:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 215 states have (on average 1.255813953488372) internal successors, (270), 216 states have internal predecessors, (270), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-16 19:05:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 342 transitions. [2025-03-16 19:05:06,411 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 342 transitions. Word has length 224 [2025-03-16 19:05:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:06,411 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 342 transitions. [2025-03-16 19:05:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-16 19:05:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 342 transitions. [2025-03-16 19:05:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:05:06,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:06,414 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] [2025-03-16 19:05:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:05:06,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -918423724, now seen corresponding path program 1 times [2025-03-16 19:05:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017038958] [2025-03-16 19:05:06,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:06,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:06,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:05:06,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:05:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:06,639 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:06,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:06,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017038958] [2025-03-16 19:05:06,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017038958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:06,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:06,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946204451] [2025-03-16 19:05:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:06,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:06,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:06,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:06,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:06,641 INFO L87 Difference]: Start difference. First operand 264 states and 342 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 19:05:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:06,713 INFO L93 Difference]: Finished difference Result 611 states and 818 transitions. [2025-03-16 19:05:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:06,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 225 [2025-03-16 19:05:06,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:06,717 INFO L225 Difference]: With dead ends: 611 [2025-03-16 19:05:06,717 INFO L226 Difference]: Without dead ends: 469 [2025-03-16 19:05:06,718 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:06,723 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 308 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:06,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 686 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:06,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-16 19:05:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 415. [2025-03-16 19:05:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 336 states have (on average 1.3035714285714286) internal successors, (438), 338 states have internal predecessors, (438), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-16 19:05:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 546 transitions. [2025-03-16 19:05:06,746 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 546 transitions. Word has length 225 [2025-03-16 19:05:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:06,747 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 546 transitions. [2025-03-16 19:05:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 19:05:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 546 transitions. [2025-03-16 19:05:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-16 19:05:06,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:06,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:05:06,750 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2082242315, now seen corresponding path program 1 times [2025-03-16 19:05:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235850295] [2025-03-16 19:05:06,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:06,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-16 19:05:06,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-16 19:05:06,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:06,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:06,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:06,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235850295] [2025-03-16 19:05:06,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235850295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:06,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:06,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:06,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787686392] [2025-03-16 19:05:06,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:06,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:06,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:06,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:06,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:06,891 INFO L87 Difference]: Start difference. First operand 415 states and 546 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:06,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:06,933 INFO L93 Difference]: Finished difference Result 879 states and 1208 transitions. [2025-03-16 19:05:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:06,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 253 [2025-03-16 19:05:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:06,937 INFO L225 Difference]: With dead ends: 879 [2025-03-16 19:05:06,937 INFO L226 Difference]: Without dead ends: 654 [2025-03-16 19:05:06,938 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:06,938 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 167 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 501 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:06,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 501 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:06,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-16 19:05:06,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 492. [2025-03-16 19:05:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 403 states have (on average 1.3126550868486353) internal successors, (529), 406 states have internal predecessors, (529), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-16 19:05:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 647 transitions. [2025-03-16 19:05:06,962 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 647 transitions. Word has length 253 [2025-03-16 19:05:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 647 transitions. [2025-03-16 19:05:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:06,964 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 647 transitions. [2025-03-16 19:05:06,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 19:05:06,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:06,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:05:06,966 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:06,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:06,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1360539533, now seen corresponding path program 1 times [2025-03-16 19:05:06,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035361514] [2025-03-16 19:05:06,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:06,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 19:05:06,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 19:05:06,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:06,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:07,053 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:07,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:07,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035361514] [2025-03-16 19:05:07,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035361514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:07,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:07,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:07,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838566156] [2025-03-16 19:05:07,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:07,055 INFO L87 Difference]: Start difference. First operand 492 states and 647 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:07,095 INFO L93 Difference]: Finished difference Result 1044 states and 1427 transitions. [2025-03-16 19:05:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:07,096 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 254 [2025-03-16 19:05:07,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:07,100 INFO L225 Difference]: With dead ends: 1044 [2025-03-16 19:05:07,100 INFO L226 Difference]: Without dead ends: 771 [2025-03-16 19:05:07,101 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:07,102 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 169 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 518 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:07,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 518 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:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-16 19:05:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 596. [2025-03-16 19:05:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 500 states have internal predecessors, (655), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-16 19:05:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 785 transitions. [2025-03-16 19:05:07,132 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 785 transitions. Word has length 254 [2025-03-16 19:05:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 785 transitions. [2025-03-16 19:05:07,133 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 19:05:07,133 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 785 transitions. [2025-03-16 19:05:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:05:07,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:07,136 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:05:07,136 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:07,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1225122862, now seen corresponding path program 1 times [2025-03-16 19:05:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:07,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546911907] [2025-03-16 19:05:07,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:07,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:07,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:07,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:07,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:07,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546911907] [2025-03-16 19:05:07,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546911907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:07,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:07,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026634080] [2025-03-16 19:05:07,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:07,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:07,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:07,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:07,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:07,228 INFO L87 Difference]: Start difference. First operand 596 states and 785 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:07,292 INFO L93 Difference]: Finished difference Result 1242 states and 1697 transitions. [2025-03-16 19:05:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:07,293 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 255 [2025-03-16 19:05:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:07,297 INFO L225 Difference]: With dead ends: 1242 [2025-03-16 19:05:07,297 INFO L226 Difference]: Without dead ends: 897 [2025-03-16 19:05:07,299 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:07,299 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 170 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 534 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:07,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 534 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:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2025-03-16 19:05:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 694. [2025-03-16 19:05:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 585 states have (on average 1.3384615384615384) internal successors, (783), 594 states have internal predecessors, (783), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 921 transitions. [2025-03-16 19:05:07,335 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 921 transitions. Word has length 255 [2025-03-16 19:05:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:07,336 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 921 transitions. [2025-03-16 19:05:07,336 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), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:07,336 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 921 transitions. [2025-03-16 19:05:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-16 19:05:07,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:07,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:05:07,338 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:07,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1059740593, now seen corresponding path program 1 times [2025-03-16 19:05:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:07,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339443846] [2025-03-16 19:05:07,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:07,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:07,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:07,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-16 19:05:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339443846] [2025-03-16 19:05:07,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339443846] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:07,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495637862] [2025-03-16 19:05:07,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:07,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:07,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:07,519 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:07,522 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:07,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-16 19:05:07,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-16 19:05:07,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:07,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:07,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:07,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2025-03-16 19:05:07,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495637862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:07,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877632820] [2025-03-16 19:05:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:07,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:07,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:07,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:07,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:07,757 INFO L87 Difference]: Start difference. First operand 694 states and 921 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:07,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:07,848 INFO L93 Difference]: Finished difference Result 1141 states and 1553 transitions. [2025-03-16 19:05:07,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:07,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 255 [2025-03-16 19:05:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:07,853 INFO L225 Difference]: With dead ends: 1141 [2025-03-16 19:05:07,853 INFO L226 Difference]: Without dead ends: 694 [2025-03-16 19:05:07,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 256 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:07,854 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 31 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 655 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:07,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 655 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-16 19:05:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-03-16 19:05:07,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 585 states have (on average 1.3282051282051281) internal successors, (777), 594 states have internal predecessors, (777), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 915 transitions. [2025-03-16 19:05:07,883 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 915 transitions. Word has length 255 [2025-03-16 19:05:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:07,884 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 915 transitions. [2025-03-16 19:05:07,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 915 transitions. [2025-03-16 19:05:07,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 19:05:07,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:07,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,894 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:08,088 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:08,088 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 803351104, now seen corresponding path program 1 times [2025-03-16 19:05:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935706193] [2025-03-16 19:05:08,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 19:05:08,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 19:05:08,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2025-03-16 19:05:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935706193] [2025-03-16 19:05:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935706193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082137730] [2025-03-16 19:05:08,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:08,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:08,285 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:08,287 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:08,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 19:05:08,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 19:05:08,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:08,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:05:08,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-16 19:05:08,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:08,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082137730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:08,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:08,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-16 19:05:08,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923836591] [2025-03-16 19:05:08,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:08,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:08,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:05:08,508 INFO L87 Difference]: Start difference. First operand 694 states and 915 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:08,581 INFO L93 Difference]: Finished difference Result 1141 states and 1539 transitions. [2025-03-16 19:05:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 256 [2025-03-16 19:05:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:08,586 INFO L225 Difference]: With dead ends: 1141 [2025-03-16 19:05:08,586 INFO L226 Difference]: Without dead ends: 706 [2025-03-16 19:05:08,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 257 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:08,588 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 7 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 663 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.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:08,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 663 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-16 19:05:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2025-03-16 19:05:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 706 states, 595 states have (on average 1.3294117647058823) internal successors, (791), 604 states have internal predecessors, (791), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 929 transitions. [2025-03-16 19:05:08,618 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 929 transitions. Word has length 256 [2025-03-16 19:05:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:08,618 INFO L471 AbstractCegarLoop]: Abstraction has 706 states and 929 transitions. [2025-03-16 19:05:08,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 929 transitions. [2025-03-16 19:05:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-16 19:05:08,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:08,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,629 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:08,822 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:08,823 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:08,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -948926937, now seen corresponding path program 1 times [2025-03-16 19:05:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:08,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99289263] [2025-03-16 19:05:08,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:08,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-16 19:05:08,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-16 19:05:08,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99289263] [2025-03-16 19:05:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99289263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:05:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44007897] [2025-03-16 19:05:09,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:05:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:05:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:05:09,006 INFO L87 Difference]: Start difference. First operand 706 states and 929 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,034 INFO L93 Difference]: Finished difference Result 1155 states and 1553 transitions. [2025-03-16 19:05:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:05:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 257 [2025-03-16 19:05:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,038 INFO L225 Difference]: With dead ends: 1155 [2025-03-16 19:05:09,038 INFO L226 Difference]: Without dead ends: 688 [2025-03-16 19:05:09,039 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:09,041 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:09,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-16 19:05:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2025-03-16 19:05:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 578 states have (on average 1.3131487889273357) internal successors, (759), 586 states have internal predecessors, (759), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 19:05:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 896 transitions. [2025-03-16 19:05:09,066 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 896 transitions. Word has length 257 [2025-03-16 19:05:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 896 transitions. [2025-03-16 19:05:09,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 19:05:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 896 transitions. [2025-03-16 19:05:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 19:05:09,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:05:09,069 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1226585698, now seen corresponding path program 1 times [2025-03-16 19:05:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137633400] [2025-03-16 19:05:09,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 19:05:09,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 19:05:09,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,382 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-16 19:05:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137633400] [2025-03-16 19:05:09,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137633400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:09,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:09,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:09,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723124710] [2025-03-16 19:05:09,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:09,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:09,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:09,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:09,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:09,383 INFO L87 Difference]: Start difference. First operand 688 states and 896 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:05:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:09,454 INFO L93 Difference]: Finished difference Result 987 states and 1359 transitions. [2025-03-16 19:05:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:05:09,454 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 258 [2025-03-16 19:05:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:09,459 INFO L225 Difference]: With dead ends: 987 [2025-03-16 19:05:09,459 INFO L226 Difference]: Without dead ends: 985 [2025-03-16 19:05:09,460 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:09,460 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 117 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1711 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:09,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1711 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:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2025-03-16 19:05:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 694. [2025-03-16 19:05:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 582 states have (on average 1.3109965635738832) internal successors, (763), 591 states have internal predecessors, (763), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-16 19:05:09,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 902 transitions. [2025-03-16 19:05:09,490 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 902 transitions. Word has length 258 [2025-03-16 19:05:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:09,490 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 902 transitions. [2025-03-16 19:05:09,491 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-16 19:05:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 902 transitions. [2025-03-16 19:05:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 19:05:09,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:09,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:05:09,493 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1032717581, now seen corresponding path program 1 times [2025-03-16 19:05:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:09,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078279614] [2025-03-16 19:05:09,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:09,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:09,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:09,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 19:05:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078279614] [2025-03-16 19:05:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078279614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774924225] [2025-03-16 19:05:09,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:09,769 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:09,771 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:09,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:09,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:09,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:09,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 19:05:09,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 248 proven. 33 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-03-16 19:05:10,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 23 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-16 19:05:10,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774924225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:10,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:10,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2025-03-16 19:05:10,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583166932] [2025-03-16 19:05:10,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:10,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:05:10,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:10,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:05:10,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:05:10,496 INFO L87 Difference]: Start difference. First operand 694 states and 902 transitions. Second operand has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-16 19:05:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:10,937 INFO L93 Difference]: Finished difference Result 1668 states and 2245 transitions. [2025-03-16 19:05:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:05:10,938 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 266 [2025-03-16 19:05:10,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:10,944 INFO L225 Difference]: With dead ends: 1668 [2025-03-16 19:05:10,944 INFO L226 Difference]: Without dead ends: 1231 [2025-03-16 19:05:10,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 523 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:10,948 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 211 mSDsluCounter, 3783 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:10,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 4119 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:05:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-03-16 19:05:10,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 961. [2025-03-16 19:05:10,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 809 states have (on average 1.3016069221260815) internal successors, (1053), 819 states have internal predecessors, (1053), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2025-03-16 19:05:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1245 transitions. [2025-03-16 19:05:10,992 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1245 transitions. Word has length 266 [2025-03-16 19:05:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:10,993 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1245 transitions. [2025-03-16 19:05:10,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 14 states have internal predecessors, (141), 5 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2025-03-16 19:05:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1245 transitions. [2025-03-16 19:05:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-16 19:05:10,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:10,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:11,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:11,197 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:11,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1994331598, now seen corresponding path program 1 times [2025-03-16 19:05:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696500767] [2025-03-16 19:05:11,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:11,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:11,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:11,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-03-16 19:05:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:11,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696500767] [2025-03-16 19:05:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696500767] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:11,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751661792] [2025-03-16 19:05:11,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:11,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:11,294 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:11,296 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:11,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-16 19:05:11,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-16 19:05:11,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:11,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-16 19:05:11,486 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751661792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877161893] [2025-03-16 19:05:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:11,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:11,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:11,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:11,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:11,488 INFO L87 Difference]: Start difference. First operand 961 states and 1245 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 19:05:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:11,595 INFO L93 Difference]: Finished difference Result 1789 states and 2358 transitions. [2025-03-16 19:05:11,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:11,595 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 266 [2025-03-16 19:05:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:11,600 INFO L225 Difference]: With dead ends: 1789 [2025-03-16 19:05:11,600 INFO L226 Difference]: Without dead ends: 945 [2025-03-16 19:05:11,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 268 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:11,602 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 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.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:11,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:11,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-03-16 19:05:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2025-03-16 19:05:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 798 states have (on average 1.2894736842105263) internal successors, (1029), 808 states have internal predecessors, (1029), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2025-03-16 19:05:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1212 transitions. [2025-03-16 19:05:11,637 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1212 transitions. Word has length 266 [2025-03-16 19:05:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:11,637 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1212 transitions. [2025-03-16 19:05:11,637 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, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 19:05:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1212 transitions. [2025-03-16 19:05:11,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-03-16 19:05:11,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:11,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,647 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:11,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:11,841 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:11,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1877597169, now seen corresponding path program 1 times [2025-03-16 19:05:11,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:11,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622473895] [2025-03-16 19:05:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:11,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 19:05:11,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 19:05:11,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:11,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 118 proven. 19 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2025-03-16 19:05:11,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622473895] [2025-03-16 19:05:11,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622473895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:11,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008250031] [2025-03-16 19:05:11,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:11,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:11,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:11,926 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:11,928 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:12,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-03-16 19:05:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-03-16 19:05:12,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:12,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 19:05:12,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-03-16 19:05:12,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008250031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-16 19:05:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177315099] [2025-03-16 19:05:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:12,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:12,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:12,127 INFO L87 Difference]: Start difference. First operand 945 states and 1212 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, (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:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:12,196 INFO L93 Difference]: Finished difference Result 1638 states and 2143 transitions. [2025-03-16 19:05:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:12,197 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, (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 269 [2025-03-16 19:05:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:12,200 INFO L225 Difference]: With dead ends: 1638 [2025-03-16 19:05:12,201 INFO L226 Difference]: Without dead ends: 801 [2025-03-16 19:05:12,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 270 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,204 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 688 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:12,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 688 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:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-03-16 19:05:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2025-03-16 19:05:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 672 states have (on average 1.2901785714285714) internal successors, (867), 682 states have internal predecessors, (867), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-16 19:05:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1028 transitions. [2025-03-16 19:05:12,239 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1028 transitions. Word has length 269 [2025-03-16 19:05:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:12,239 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1028 transitions. [2025-03-16 19:05:12,239 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, (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:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1028 transitions. [2025-03-16 19:05:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-16 19:05:12,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:12,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:12,445 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2023961405, now seen corresponding path program 1 times [2025-03-16 19:05:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708311275] [2025-03-16 19:05:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 19:05:12,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 19:05:12,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:12,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,799 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 20 proven. 141 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-16 19:05:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708311275] [2025-03-16 19:05:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708311275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:13,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106923643] [2025-03-16 19:05:13,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:13,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:13,802 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:13,804 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:13,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-03-16 19:05:13,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-03-16 19:05:13,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:13,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:13,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:13,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:14,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106923643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2025-03-16 19:05:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286105853] [2025-03-16 19:05:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:14,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:05:14,190 INFO L87 Difference]: Start difference. First operand 801 states and 1028 transitions. Second operand has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:14,753 INFO L93 Difference]: Finished difference Result 2144 states and 2763 transitions. [2025-03-16 19:05:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 281 [2025-03-16 19:05:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:14,760 INFO L225 Difference]: With dead ends: 2144 [2025-03-16 19:05:14,760 INFO L226 Difference]: Without dead ends: 1700 [2025-03-16 19:05:14,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 19:05:14,762 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 612 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 2730 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:14,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 2730 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:05:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2025-03-16 19:05:14,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1334. [2025-03-16 19:05:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1107 states have (on average 1.2737127371273713) internal successors, (1410), 1122 states have internal predecessors, (1410), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2025-03-16 19:05:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1707 transitions. [2025-03-16 19:05:14,824 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1707 transitions. Word has length 281 [2025-03-16 19:05:14,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:14,824 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1707 transitions. [2025-03-16 19:05:14,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.3) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1707 transitions. [2025-03-16 19:05:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:14,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:14,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,834 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:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-16 19:05:15,028 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1240112512, now seen corresponding path program 1 times [2025-03-16 19:05:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976687424] [2025-03-16 19:05:15,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:15,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:15,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-16 19:05:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976687424] [2025-03-16 19:05:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976687424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:05:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452590632] [2025-03-16 19:05:15,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:15,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:05:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:15,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:05:15,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:05:15,172 INFO L87 Difference]: Start difference. First operand 1334 states and 1707 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:15,251 INFO L93 Difference]: Finished difference Result 2461 states and 3238 transitions. [2025-03-16 19:05:15,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:05:15,251 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2025-03-16 19:05:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:15,257 INFO L225 Difference]: With dead ends: 2461 [2025-03-16 19:05:15,257 INFO L226 Difference]: Without dead ends: 1469 [2025-03-16 19:05:15,259 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:15,260 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 36 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:15,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 751 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:05:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-03-16 19:05:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1427. [2025-03-16 19:05:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1179 states have (on average 1.2849872773536897) internal successors, (1515), 1194 states have internal predecessors, (1515), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-16 19:05:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1854 transitions. [2025-03-16 19:05:15,321 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1854 transitions. Word has length 287 [2025-03-16 19:05:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:15,321 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1854 transitions. [2025-03-16 19:05:15,321 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1854 transitions. [2025-03-16 19:05:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:15,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:15,323 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:05:15,323 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:15,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1822578626, now seen corresponding path program 1 times [2025-03-16 19:05:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332336136] [2025-03-16 19:05:15,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:15,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:15,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:15,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:15,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2025-03-16 19:05:15,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332336136] [2025-03-16 19:05:15,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332336136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:15,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259849733] [2025-03-16 19:05:15,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:15,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:15,893 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:15,894 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:15,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:16,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:16,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:16,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:16,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 19:05:16,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 19:05:16,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259849733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:16,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 19 [2025-03-16 19:05:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376885918] [2025-03-16 19:05:16,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:05:16,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:16,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:05:16,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:05:16,222 INFO L87 Difference]: Start difference. First operand 1427 states and 1854 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:16,792 INFO L93 Difference]: Finished difference Result 3383 states and 4391 transitions. [2025-03-16 19:05:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 19:05:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2025-03-16 19:05:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:16,801 INFO L225 Difference]: With dead ends: 3383 [2025-03-16 19:05:16,801 INFO L226 Difference]: Without dead ends: 2299 [2025-03-16 19:05:16,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=845, Unknown=0, NotChecked=0, Total=992 [2025-03-16 19:05:16,804 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 602 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2777 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:16,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2777 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:05:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2025-03-16 19:05:16,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 1640. [2025-03-16 19:05:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1355 states have (on average 1.2752767527675277) internal successors, (1728), 1372 states have internal predecessors, (1728), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2025-03-16 19:05:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2121 transitions. [2025-03-16 19:05:16,875 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2121 transitions. Word has length 287 [2025-03-16 19:05:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:16,876 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2121 transitions. [2025-03-16 19:05:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 9 states have internal predecessors, (111), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-16 19:05:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2121 transitions. [2025-03-16 19:05:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:16,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:16,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,886 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:17,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-16 19:05:17,083 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:17,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:17,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1379051202, now seen corresponding path program 1 times [2025-03-16 19:05:17,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:17,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863595361] [2025-03-16 19:05:17,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:17,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:17,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:17,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2025-03-16 19:05:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863595361] [2025-03-16 19:05:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863595361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790228513] [2025-03-16 19:05:17,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:17,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:17,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:17,606 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:17,608 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:17,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:17,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:17,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:17,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:17,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:05:17,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2025-03-16 19:05:17,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:05:17,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790228513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:17,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 19:05:17,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2025-03-16 19:05:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545419193] [2025-03-16 19:05:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:17,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:17,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:05:17,909 INFO L87 Difference]: Start difference. First operand 1640 states and 2121 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-16 19:05:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:18,140 INFO L93 Difference]: Finished difference Result 3194 states and 4166 transitions. [2025-03-16 19:05:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:05:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 287 [2025-03-16 19:05:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:18,148 INFO L225 Difference]: With dead ends: 3194 [2025-03-16 19:05:18,148 INFO L226 Difference]: Without dead ends: 2003 [2025-03-16 19:05:18,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:05:18,152 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 122 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:18,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1689 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2025-03-16 19:05:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1748. [2025-03-16 19:05:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1444 states have (on average 1.2721606648199446) internal successors, (1837), 1455 states have internal predecessors, (1837), 211 states have call successors, (211), 93 states have call predecessors, (211), 92 states have return successors, (210), 199 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-16 19:05:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2258 transitions. [2025-03-16 19:05:18,238 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2258 transitions. Word has length 287 [2025-03-16 19:05:18,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:18,238 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2258 transitions. [2025-03-16 19:05:18,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-16 19:05:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2258 transitions. [2025-03-16 19:05:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 19:05:18,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:18,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,249 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:18,441 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:18,442 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1864311807, now seen corresponding path program 1 times [2025-03-16 19:05:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272712981] [2025-03-16 19:05:18,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:18,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 19:05:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 19:05:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 764 trivial. 0 not checked. [2025-03-16 19:05:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:18,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272712981] [2025-03-16 19:05:18,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272712981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:18,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:18,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:18,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829147241] [2025-03-16 19:05:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:18,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:18,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:18,559 INFO L87 Difference]: Start difference. First operand 1748 states and 2258 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-16 19:05:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:18,713 INFO L93 Difference]: Finished difference Result 3160 states and 4118 transitions. [2025-03-16 19:05:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:05:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 287 [2025-03-16 19:05:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:18,721 INFO L225 Difference]: With dead ends: 3160 [2025-03-16 19:05:18,721 INFO L226 Difference]: Without dead ends: 1772 [2025-03-16 19:05:18,724 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:18,724 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 238 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:18,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 664 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:05:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-16 19:05:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1645. [2025-03-16 19:05:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1358 states have (on average 1.2709867452135493) internal successors, (1726), 1368 states have internal predecessors, (1726), 199 states have call successors, (199), 88 states have call predecessors, (199), 87 states have return successors, (198), 188 states have call predecessors, (198), 198 states have call successors, (198) [2025-03-16 19:05:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2123 transitions. [2025-03-16 19:05:18,790 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2123 transitions. Word has length 287 [2025-03-16 19:05:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:18,790 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2123 transitions. [2025-03-16 19:05:18,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-16 19:05:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2123 transitions. [2025-03-16 19:05:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-16 19:05:18,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:18,794 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:05:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:05:18,794 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1820827230, now seen corresponding path program 1 times [2025-03-16 19:05:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381820317] [2025-03-16 19:05:18,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:18,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-03-16 19:05:18,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-03-16 19:05:18,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:18,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-03-16 19:05:18,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:18,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381820317] [2025-03-16 19:05:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381820317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:18,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:18,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:05:18,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702453291] [2025-03-16 19:05:18,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:18,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:05:18,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:18,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:05:18,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:05:18,933 INFO L87 Difference]: Start difference. First operand 1645 states and 2123 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 19:05:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:19,189 INFO L93 Difference]: Finished difference Result 2884 states and 3742 transitions. [2025-03-16 19:05:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:05:19,190 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 294 [2025-03-16 19:05:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:19,198 INFO L225 Difference]: With dead ends: 2884 [2025-03-16 19:05:19,198 INFO L226 Difference]: Without dead ends: 1592 [2025-03-16 19:05:19,202 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:19,202 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 423 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:19,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 884 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-16 19:05:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1352. [2025-03-16 19:05:19,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 1125 states have (on average 1.248888888888889) internal successors, (1405), 1133 states have internal predecessors, (1405), 156 states have call successors, (156), 70 states have call predecessors, (156), 70 states have return successors, (156), 148 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-16 19:05:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1717 transitions. [2025-03-16 19:05:19,274 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1717 transitions. Word has length 294 [2025-03-16 19:05:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:19,274 INFO L471 AbstractCegarLoop]: Abstraction has 1352 states and 1717 transitions. [2025-03-16 19:05:19,275 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-16 19:05:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1717 transitions. [2025-03-16 19:05:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 19:05:19,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:19,278 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:05:19,278 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:19,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:19,278 INFO L85 PathProgramCache]: Analyzing trace with hash 283970175, now seen corresponding path program 1 times [2025-03-16 19:05:19,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:19,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979763236] [2025-03-16 19:05:19,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:19,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 19:05:19,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 19:05:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-03-16 19:05:19,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:19,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979763236] [2025-03-16 19:05:19,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979763236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:19,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777498629] [2025-03-16 19:05:19,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:19,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:19,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:19,822 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:19,823 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:19,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 19:05:20,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 19:05:20,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:20,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:20,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 19:05:20,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 225 proven. 64 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-16 19:05:20,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-16 19:05:21,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777498629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:21,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:21,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 12] total 31 [2025-03-16 19:05:21,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624408411] [2025-03-16 19:05:21,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:21,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 19:05:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:21,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 19:05:21,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2025-03-16 19:05:21,226 INFO L87 Difference]: Start difference. First operand 1352 states and 1717 transitions. Second operand has 31 states, 30 states have (on average 9.366666666666667) internal successors, (281), 29 states have internal predecessors, (281), 15 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) [2025-03-16 19:05:25,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:25,619 INFO L93 Difference]: Finished difference Result 7111 states and 9618 transitions. [2025-03-16 19:05:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-16 19:05:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 9.366666666666667) internal successors, (281), 29 states have internal predecessors, (281), 15 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) Word has length 335 [2025-03-16 19:05:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:25,650 INFO L225 Difference]: With dead ends: 7111 [2025-03-16 19:05:25,651 INFO L226 Difference]: Without dead ends: 6119 [2025-03-16 19:05:25,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4061 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1584, Invalid=12696, Unknown=0, NotChecked=0, Total=14280 [2025-03-16 19:05:25,658 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2958 mSDsluCounter, 8791 mSDsCounter, 0 mSdLazyCounter, 3725 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2958 SdHoareTripleChecker+Valid, 9249 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 3725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:25,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2958 Valid, 9249 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 3725 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 19:05:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2025-03-16 19:05:25,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 2536. [2025-03-16 19:05:25,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2104 states have (on average 1.2690114068441065) internal successors, (2670), 2120 states have internal predecessors, (2670), 298 states have call successors, (298), 133 states have call predecessors, (298), 133 states have return successors, (298), 282 states have call predecessors, (298), 298 states have call successors, (298) [2025-03-16 19:05:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3266 transitions. [2025-03-16 19:05:25,834 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3266 transitions. Word has length 335 [2025-03-16 19:05:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 2536 states and 3266 transitions. [2025-03-16 19:05:25,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 9.366666666666667) internal successors, (281), 29 states have internal predecessors, (281), 15 states have call successors, (56), 7 states have call predecessors, (56), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) [2025-03-16 19:05:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3266 transitions. [2025-03-16 19:05:25,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 19:05:25,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:25,839 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 19:05:26,040 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,SelfDestructingSolverStorable38 [2025-03-16 19:05:26,041 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:26,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash -899377122, now seen corresponding path program 1 times [2025-03-16 19:05:26,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:26,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677847700] [2025-03-16 19:05:26,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:26,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:26,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 19:05:26,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 19:05:26,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:26,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 842 trivial. 0 not checked. [2025-03-16 19:05:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:26,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677847700] [2025-03-16 19:05:26,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677847700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:05:26,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:05:26,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:05:26,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865830184] [2025-03-16 19:05:26,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:05:26,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:05:26,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:26,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:05:26,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:05:26,241 INFO L87 Difference]: Start difference. First operand 2536 states and 3266 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 19:05:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:26,618 INFO L93 Difference]: Finished difference Result 5030 states and 6508 transitions. [2025-03-16 19:05:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:05:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 335 [2025-03-16 19:05:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:26,631 INFO L225 Difference]: With dead ends: 5030 [2025-03-16 19:05:26,632 INFO L226 Difference]: Without dead ends: 2989 [2025-03-16 19:05:26,636 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:26,637 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 151 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:26,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 2172 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:05:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2025-03-16 19:05:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2344. [2025-03-16 19:05:26,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1960 states have (on average 1.2581632653061225) internal successors, (2466), 1976 states have internal predecessors, (2466), 262 states have call successors, (262), 121 states have call predecessors, (262), 121 states have return successors, (262), 246 states have call predecessors, (262), 262 states have call successors, (262) [2025-03-16 19:05:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 2990 transitions. [2025-03-16 19:05:26,783 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 2990 transitions. Word has length 335 [2025-03-16 19:05:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:26,788 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 2990 transitions. [2025-03-16 19:05:26,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-16 19:05:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 2990 transitions. [2025-03-16 19:05:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-16 19:05:26,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:26,800 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:05:26,800 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:26,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -159454944, now seen corresponding path program 1 times [2025-03-16 19:05:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:26,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929436363] [2025-03-16 19:05:26,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:26,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 19:05:26,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 19:05:26,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:26,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-16 19:05:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929436363] [2025-03-16 19:05:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929436363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507591751] [2025-03-16 19:05:27,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:27,636 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:27,637 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:27,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-16 19:05:27,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-16 19:05:27,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:27,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:27,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 19:05:27,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 225 proven. 62 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-03-16 19:05:28,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 839 trivial. 0 not checked. [2025-03-16 19:05:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507591751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:28,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 13] total 28 [2025-03-16 19:05:28,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604350176] [2025-03-16 19:05:28,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:28,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:05:28,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:28,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:05:28,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=648, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:05:28,931 INFO L87 Difference]: Start difference. First operand 2344 states and 2990 transitions. Second operand has 28 states, 27 states have (on average 10.592592592592593) internal successors, (286), 27 states have internal predecessors, (286), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) [2025-03-16 19:05:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:05:41,812 INFO L93 Difference]: Finished difference Result 33876 states and 45764 transitions. [2025-03-16 19:05:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2025-03-16 19:05:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 10.592592592592593) internal successors, (286), 27 states have internal predecessors, (286), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) Word has length 336 [2025-03-16 19:05:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:05:41,897 INFO L225 Difference]: With dead ends: 33876 [2025-03-16 19:05:41,897 INFO L226 Difference]: Without dead ends: 32027 [2025-03-16 19:05:41,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38453 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8797, Invalid=80903, Unknown=0, NotChecked=0, Total=89700 [2025-03-16 19:05:41,919 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 10264 mSDsluCounter, 17376 mSDsCounter, 0 mSdLazyCounter, 8177 mSolverCounterSat, 2528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10264 SdHoareTripleChecker+Valid, 18882 SdHoareTripleChecker+Invalid, 10705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2528 IncrementalHoareTripleChecker+Valid, 8177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:05:41,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10264 Valid, 18882 Invalid, 10705 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2528 Valid, 8177 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 19:05:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32027 states. [2025-03-16 19:05:42,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32027 to 5372. [2025-03-16 19:05:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 4429 states have (on average 1.2648453375479791) internal successors, (5602), 4471 states have internal predecessors, (5602), 650 states have call successors, (650), 292 states have call predecessors, (650), 292 states have return successors, (650), 608 states have call predecessors, (650), 650 states have call successors, (650) [2025-03-16 19:05:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 6902 transitions. [2025-03-16 19:05:42,627 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 6902 transitions. Word has length 336 [2025-03-16 19:05:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:05:42,627 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 6902 transitions. [2025-03-16 19:05:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 10.592592592592593) internal successors, (286), 27 states have internal predecessors, (286), 15 states have call successors, (60), 7 states have call predecessors, (60), 6 states have return successors, (58), 14 states have call predecessors, (58), 14 states have call successors, (58) [2025-03-16 19:05:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 6902 transitions. [2025-03-16 19:05:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-16 19:05:42,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:05:42,636 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 19:05:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:42,841 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:05:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:05:42,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1370979694, now seen corresponding path program 1 times [2025-03-16 19:05:42,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:05:42,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045198356] [2025-03-16 19:05:42,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:05:42,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 19:05:42,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 19:05:42,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:42,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 819 trivial. 0 not checked. [2025-03-16 19:05:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:05:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045198356] [2025-03-16 19:05:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045198356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:05:43,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261536316] [2025-03-16 19:05:43,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:05:43,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:05:43,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:05:43,574 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:05:43,575 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:05:43,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 19:05:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 19:05:43,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:05:43,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:05:43,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-16 19:05:43,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:05:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 195 proven. 91 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-03-16 19:05:44,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:05:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 866 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-03-16 19:05:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261536316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:05:45,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:05:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 18] total 43 [2025-03-16 19:05:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629030218] [2025-03-16 19:05:45,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:05:45,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 19:05:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:05:45,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 19:05:45,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1653, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 19:05:45,106 INFO L87 Difference]: Start difference. First operand 5372 states and 6902 transitions. Second operand has 43 states, 42 states have (on average 7.238095238095238) internal successors, (304), 39 states have internal predecessors, (304), 14 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 16 states have call predecessors, (55), 13 states have call successors, (55) [2025-03-16 19:06:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:06:14,322 INFO L93 Difference]: Finished difference Result 111136 states and 148112 transitions. [2025-03-16 19:06:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 545 states. [2025-03-16 19:06:14,323 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 7.238095238095238) internal successors, (304), 39 states have internal predecessors, (304), 14 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 16 states have call predecessors, (55), 13 states have call successors, (55) Word has length 337 [2025-03-16 19:06:14,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:06:14,670 INFO L225 Difference]: With dead ends: 111136 [2025-03-16 19:06:14,670 INFO L226 Difference]: Without dead ends: 106504 [2025-03-16 19:06:14,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1276 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 584 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150380 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=16608, Invalid=326202, Unknown=0, NotChecked=0, Total=342810 [2025-03-16 19:06:14,726 INFO L435 NwaCegarLoop]: 1357 mSDtfsCounter, 10677 mSDsluCounter, 32197 mSDsCounter, 0 mSdLazyCounter, 17870 mSolverCounterSat, 2946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10677 SdHoareTripleChecker+Valid, 33554 SdHoareTripleChecker+Invalid, 20816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2946 IncrementalHoareTripleChecker+Valid, 17870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:06:14,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10677 Valid, 33554 Invalid, 20816 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2946 Valid, 17870 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-16 19:06:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106504 states. [2025-03-16 19:06:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106504 to 12875. [2025-03-16 19:06:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 10435 states have (on average 1.261044561571634) internal successors, (13159), 10547 states have internal predecessors, (13159), 1695 states have call successors, (1695), 744 states have call predecessors, (1695), 744 states have return successors, (1695), 1583 states have call predecessors, (1695), 1695 states have call successors, (1695) [2025-03-16 19:06:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 16549 transitions. [2025-03-16 19:06:16,910 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 16549 transitions. Word has length 337 [2025-03-16 19:06:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:06:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 12875 states and 16549 transitions. [2025-03-16 19:06:16,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 7.238095238095238) internal successors, (304), 39 states have internal predecessors, (304), 14 states have call successors, (56), 7 states have call predecessors, (56), 9 states have return successors, (55), 16 states have call predecessors, (55), 13 states have call successors, (55) [2025-03-16 19:06:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 16549 transitions. [2025-03-16 19:06:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-03-16 19:06:16,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:06:16,932 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 19:06:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-16 19:06:17,133 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:06:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:06:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1191224329, now seen corresponding path program 1 times [2025-03-16 19:06:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:06:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781283591] [2025-03-16 19:06:17,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:06:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:06:17,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-03-16 19:06:17,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-03-16 19:06:17,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:06:17,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:06:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2025-03-16 19:06:17,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:06:17,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781283591] [2025-03-16 19:06:17,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781283591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:06:17,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:06:17,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:06:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682911280] [2025-03-16 19:06:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:06:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:06:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:06:17,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:06:17,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:06:17,546 INFO L87 Difference]: Start difference. First operand 12875 states and 16549 transitions. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19)