./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.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 e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:23:27,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:23:27,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:23:27,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:23:27,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:23:27,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:23:27,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:23:27,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:23:27,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:23:27,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:23:27,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:23:27,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:23:27,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:23:27,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:23:27,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:23:27,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:23:27,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:23:27,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:27,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:23:27,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:23:27,884 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 -> e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb [2025-03-16 20:23:28,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:23:28,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:23:28,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:23:28,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:23:28,094 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:23:28,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-03-16 20:23:29,208 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e874de9d9/4a544412a630492b997c1cac933549d9/FLAGae091f275 [2025-03-16 20:23:29,695 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:23:29,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-03-16 20:23:29,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e874de9d9/4a544412a630492b997c1cac933549d9/FLAGae091f275 [2025-03-16 20:23:29,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e874de9d9/4a544412a630492b997c1cac933549d9 [2025-03-16 20:23:29,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:23:29,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:23:29,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:29,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:23:29,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:23:29,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:29" (1/1) ... [2025-03-16 20:23:29,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e84bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:29, skipping insertion in model container [2025-03-16 20:23:29,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:23:29" (1/1) ... [2025-03-16 20:23:29,831 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:23:30,067 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2025-03-16 20:23:30,110 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2025-03-16 20:23:30,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:30,490 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:23:30,523 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2025-03-16 20:23:30,533 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/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2025-03-16 20:23:30,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:23:30,801 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:23:30,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30 WrapperNode [2025-03-16 20:23:30,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:23:30,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:30,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:23:30,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:23:30,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:30,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,089 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-03-16 20:23:31,090 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:23:31,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:23:31,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:23:31,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:23:31,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,279 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 20:23:31,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,404 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,423 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:23:31,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:23:31,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:23:31,490 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:23:31,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (1/1) ... [2025-03-16 20:23:31,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:23:31,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:31,516 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 20:23:31,521 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 20:23:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:23:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:23:31,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:23:31,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:23:31,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:23:31,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:23:35,067 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5020: havoc calculate_output3_#t~ret36#1; [2025-03-16 20:23:35,067 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2051: havoc calculate_output_#t~ret34#1; [2025-03-16 20:23:35,068 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3530: havoc calculate_output2_#t~ret35#1; [2025-03-16 20:23:35,189 INFO L? ?]: Removed 734 outVars from TransFormulas that were not future-live. [2025-03-16 20:23:35,190 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:23:35,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:23:35,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:23:35,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:35 BoogieIcfgContainer [2025-03-16 20:23:35,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:23:35,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:23:35,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:23:35,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:23:35,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:23:29" (1/3) ... [2025-03-16 20:23:35,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c468e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:35, skipping insertion in model container [2025-03-16 20:23:35,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:23:30" (2/3) ... [2025-03-16 20:23:35,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c468e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:23:35, skipping insertion in model container [2025-03-16 20:23:35,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:23:35" (3/3) ... [2025-03-16 20:23:35,225 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-03-16 20:23:35,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:23:35,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c that has 1 procedures, 820 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:23:35,308 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:23:35,318 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;@43f646d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:23:35,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:23:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:35,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:35,332 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:35,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1252836054, now seen corresponding path program 1 times [2025-03-16 20:23:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:35,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982182262] [2025-03-16 20:23:35,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:35,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:35,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:35,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:35,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:35,526 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 20:23:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:35,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982182262] [2025-03-16 20:23:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982182262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:35,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:23:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748953938] [2025-03-16 20:23:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:35,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:23:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:35,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:23:35,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:23:35,549 INFO L87 Difference]: Start difference. First operand has 820 states, 817 states have (on average 1.9755201958384332) internal successors, (1614), 819 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:35,598 INFO L93 Difference]: Finished difference Result 1613 states and 3176 transitions. [2025-03-16 20:23:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:23:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 20:23:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:35,617 INFO L225 Difference]: With dead ends: 1613 [2025-03-16 20:23:35,618 INFO L226 Difference]: Without dead ends: 816 [2025-03-16 20:23:35,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:23:35,623 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:35,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-16 20:23:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2025-03-16 20:23:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.898034398034398) internal successors, (1545), 815 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1545 transitions. [2025-03-16 20:23:35,682 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1545 transitions. Word has length 19 [2025-03-16 20:23:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:35,683 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1545 transitions. [2025-03-16 20:23:35,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1545 transitions. [2025-03-16 20:23:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:23:35,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:35,684 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:35,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:23:35,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:35,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:35,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1534579433, now seen corresponding path program 1 times [2025-03-16 20:23:35,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:35,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019632325] [2025-03-16 20:23:35,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:35,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:23:35,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:23:35,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:35,816 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 20:23:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019632325] [2025-03-16 20:23:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019632325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852601145] [2025-03-16 20:23:35,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:35,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:35,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:35,818 INFO L87 Difference]: Start difference. First operand 816 states and 1545 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:35,902 INFO L93 Difference]: Finished difference Result 889 states and 1660 transitions. [2025-03-16 20:23:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 20:23:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:35,906 INFO L225 Difference]: With dead ends: 889 [2025-03-16 20:23:35,906 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:23:35,907 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 20:23:35,907 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 55 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4598 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:35,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4598 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:23:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 816. [2025-03-16 20:23:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.8697788697788698) internal successors, (1522), 815 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1522 transitions. [2025-03-16 20:23:35,970 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1522 transitions. Word has length 19 [2025-03-16 20:23:35,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:35,970 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1522 transitions. [2025-03-16 20:23:35,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1522 transitions. [2025-03-16 20:23:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:23:35,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:35,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:23:35,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:35,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -215177375, now seen corresponding path program 1 times [2025-03-16 20:23:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447682774] [2025-03-16 20:23:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:35,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:23:36,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:23:36,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:36,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:36,223 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 20:23:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447682774] [2025-03-16 20:23:36,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447682774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:36,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:36,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787246996] [2025-03-16 20:23:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:36,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:36,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:36,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:36,227 INFO L87 Difference]: Start difference. First operand 816 states and 1522 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:36,369 INFO L93 Difference]: Finished difference Result 1096 states and 1970 transitions. [2025-03-16 20:23:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:23:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 20:23:36,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:36,374 INFO L225 Difference]: With dead ends: 1096 [2025-03-16 20:23:36,374 INFO L226 Difference]: Without dead ends: 1061 [2025-03-16 20:23:36,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:23:36,375 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 6246 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6246 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:36,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6246 Valid, 2171 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-03-16 20:23:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 849. [2025-03-16 20:23:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.859504132231405) internal successors, (1575), 848 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1575 transitions. [2025-03-16 20:23:36,394 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1575 transitions. Word has length 41 [2025-03-16 20:23:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:36,395 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1575 transitions. [2025-03-16 20:23:36,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1575 transitions. [2025-03-16 20:23:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:36,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:36,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:36,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:23:36,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash -589844957, now seen corresponding path program 1 times [2025-03-16 20:23:36,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:36,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662796023] [2025-03-16 20:23:36,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:36,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:36,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:36,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:36,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:36,590 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 20:23:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:36,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662796023] [2025-03-16 20:23:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662796023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:36,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:36,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:36,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596532719] [2025-03-16 20:23:36,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:36,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:36,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:36,592 INFO L87 Difference]: Start difference. First operand 849 states and 1575 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:36,686 INFO L93 Difference]: Finished difference Result 919 states and 1685 transitions. [2025-03-16 20:23:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:36,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 20:23:36,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:36,690 INFO L225 Difference]: With dead ends: 919 [2025-03-16 20:23:36,690 INFO L226 Difference]: Without dead ends: 851 [2025-03-16 20:23:36,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:23:36,693 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 5916 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5916 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:36,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5916 Valid, 1672 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:36,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-03-16 20:23:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2025-03-16 20:23:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 847 states have (on average 1.858323494687131) internal successors, (1574), 848 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1574 transitions. [2025-03-16 20:23:36,716 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1574 transitions. Word has length 43 [2025-03-16 20:23:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:36,716 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1574 transitions. [2025-03-16 20:23:36,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1574 transitions. [2025-03-16 20:23:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:23:36,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:36,719 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:36,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:23:36,720 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:36,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash -590887642, now seen corresponding path program 1 times [2025-03-16 20:23:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765433986] [2025-03-16 20:23:36,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:36,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:23:36,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:23:36,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:36,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:36,787 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 20:23:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:36,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765433986] [2025-03-16 20:23:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765433986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164633265] [2025-03-16 20:23:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:36,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:36,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:36,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:36,790 INFO L87 Difference]: Start difference. First operand 849 states and 1574 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:36,810 INFO L93 Difference]: Finished difference Result 974 states and 1771 transitions. [2025-03-16 20:23:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:36,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 20:23:36,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:36,814 INFO L225 Difference]: With dead ends: 974 [2025-03-16 20:23:36,814 INFO L226 Difference]: Without dead ends: 906 [2025-03-16 20:23:36,814 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 20:23:36,815 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:36,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1572 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-03-16 20:23:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904. [2025-03-16 20:23:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 902 states have (on average 1.8392461197339247) internal successors, (1659), 903 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1659 transitions. [2025-03-16 20:23:36,835 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1659 transitions. Word has length 43 [2025-03-16 20:23:36,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:36,836 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1659 transitions. [2025-03-16 20:23:36,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1659 transitions. [2025-03-16 20:23:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:23:36,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:36,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:36,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:23:36,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:36,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1104339423, now seen corresponding path program 1 times [2025-03-16 20:23:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:36,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679550331] [2025-03-16 20:23:36,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:23:36,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:23:36,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:36,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,043 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 20:23:37,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679550331] [2025-03-16 20:23:37,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679550331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:23:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597137648] [2025-03-16 20:23:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:37,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:37,047 INFO L87 Difference]: Start difference. First operand 904 states and 1659 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:37,074 INFO L93 Difference]: Finished difference Result 910 states and 1666 transitions. [2025-03-16 20:23:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:37,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 20:23:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:37,078 INFO L225 Difference]: With dead ends: 910 [2025-03-16 20:23:37,078 INFO L226 Difference]: Without dead ends: 908 [2025-03-16 20:23:37,078 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 20:23:37,079 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:37,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-16 20:23:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 908. [2025-03-16 20:23:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 906 states have (on average 1.8344370860927153) internal successors, (1662), 907 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1662 transitions. [2025-03-16 20:23:37,095 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1662 transitions. Word has length 44 [2025-03-16 20:23:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:37,096 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1662 transitions. [2025-03-16 20:23:37,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1662 transitions. [2025-03-16 20:23:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:37,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:37,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:37,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:23:37,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:37,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash 937978053, now seen corresponding path program 1 times [2025-03-16 20:23:37,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:37,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427792803] [2025-03-16 20:23:37,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:37,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:37,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:37,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:37,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,153 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 20:23:37,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427792803] [2025-03-16 20:23:37,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427792803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087572070] [2025-03-16 20:23:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:37,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:37,154 INFO L87 Difference]: Start difference. First operand 908 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:37,176 INFO L93 Difference]: Finished difference Result 1046 states and 1875 transitions. [2025-03-16 20:23:37,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:37,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:37,180 INFO L225 Difference]: With dead ends: 1046 [2025-03-16 20:23:37,180 INFO L226 Difference]: Without dead ends: 974 [2025-03-16 20:23:37,181 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 20:23:37,181 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1484 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:37,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-16 20:23:37,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 972. [2025-03-16 20:23:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 970 states have (on average 1.81340206185567) internal successors, (1759), 971 states have internal predecessors, (1759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1759 transitions. [2025-03-16 20:23:37,200 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1759 transitions. Word has length 45 [2025-03-16 20:23:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:37,201 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1759 transitions. [2025-03-16 20:23:37,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,202 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1759 transitions. [2025-03-16 20:23:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:37,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:37,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:37,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:23:37,203 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1695018693, now seen corresponding path program 1 times [2025-03-16 20:23:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:37,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072689652] [2025-03-16 20:23:37,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:37,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:37,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:37,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:37,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,257 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 20:23:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072689652] [2025-03-16 20:23:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072689652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604247432] [2025-03-16 20:23:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:37,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:37,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:37,258 INFO L87 Difference]: Start difference. First operand 972 states and 1759 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:37,282 INFO L93 Difference]: Finished difference Result 1326 states and 2299 transitions. [2025-03-16 20:23:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:37,286 INFO L225 Difference]: With dead ends: 1326 [2025-03-16 20:23:37,286 INFO L226 Difference]: Without dead ends: 1137 [2025-03-16 20:23:37,286 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 20:23:37,287 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 1480 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:37,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1620 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:37,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-03-16 20:23:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1135. [2025-03-16 20:23:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1133 states have (on average 1.766107678729038) internal successors, (2001), 1134 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2001 transitions. [2025-03-16 20:23:37,306 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2001 transitions. Word has length 45 [2025-03-16 20:23:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:37,307 INFO L471 AbstractCegarLoop]: Abstraction has 1135 states and 2001 transitions. [2025-03-16 20:23:37,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2001 transitions. [2025-03-16 20:23:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:37,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:37,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:37,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:23:37,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1145229765, now seen corresponding path program 1 times [2025-03-16 20:23:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78166034] [2025-03-16 20:23:37,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:37,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:37,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:37,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,367 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 20:23:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78166034] [2025-03-16 20:23:37,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78166034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519173086] [2025-03-16 20:23:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:37,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:37,369 INFO L87 Difference]: Start difference. First operand 1135 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:37,394 INFO L93 Difference]: Finished difference Result 1791 states and 2983 transitions. [2025-03-16 20:23:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:37,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:37,401 INFO L225 Difference]: With dead ends: 1791 [2025-03-16 20:23:37,401 INFO L226 Difference]: Without dead ends: 1439 [2025-03-16 20:23:37,402 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 20:23:37,403 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 1478 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:37,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1622 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:37,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2025-03-16 20:23:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1437. [2025-03-16 20:23:37,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1435 states have (on average 1.6982578397212544) internal successors, (2437), 1436 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2437 transitions. [2025-03-16 20:23:37,428 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2437 transitions. Word has length 45 [2025-03-16 20:23:37,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:37,429 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2437 transitions. [2025-03-16 20:23:37,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2437 transitions. [2025-03-16 20:23:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:23:37,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:37,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:23:37,430 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:37,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:37,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1761201093, now seen corresponding path program 1 times [2025-03-16 20:23:37,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:37,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388371285] [2025-03-16 20:23:37,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:23:37,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:23:37,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:37,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,480 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 20:23:37,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388371285] [2025-03-16 20:23:37,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388371285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071679605] [2025-03-16 20:23:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:37,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:37,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:37,482 INFO L87 Difference]: Start difference. First operand 1437 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:37,510 INFO L93 Difference]: Finished difference Result 2649 states and 4207 transitions. [2025-03-16 20:23:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:37,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:23:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:37,516 INFO L225 Difference]: With dead ends: 2649 [2025-03-16 20:23:37,516 INFO L226 Difference]: Without dead ends: 1995 [2025-03-16 20:23:37,517 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 20:23:37,518 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1482 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:37,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:37,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-03-16 20:23:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1993. [2025-03-16 20:23:37,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1993 states, 1991 states have (on average 1.6137619286790557) internal successors, (3213), 1992 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 3213 transitions. [2025-03-16 20:23:37,557 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 3213 transitions. Word has length 45 [2025-03-16 20:23:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:37,557 INFO L471 AbstractCegarLoop]: Abstraction has 1993 states and 3213 transitions. [2025-03-16 20:23:37,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 3213 transitions. [2025-03-16 20:23:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:23:37,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:37,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:37,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:23:37,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:37,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:37,559 INFO L85 PathProgramCache]: Analyzing trace with hash 421345978, now seen corresponding path program 1 times [2025-03-16 20:23:37,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714545937] [2025-03-16 20:23:37,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:37,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:23:37,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:23:37,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:37,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:37,663 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 20:23:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714545937] [2025-03-16 20:23:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714545937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886192934] [2025-03-16 20:23:37,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:37,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:23:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:37,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:23:37,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:23:37,665 INFO L87 Difference]: Start difference. First operand 1993 states and 3213 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:42,144 INFO L93 Difference]: Finished difference Result 4248 states and 7522 transitions. [2025-03-16 20:23:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:23:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 20:23:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:42,155 INFO L225 Difference]: With dead ends: 4248 [2025-03-16 20:23:42,155 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 20:23:42,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 20:23:42,157 INFO L435 NwaCegarLoop]: 758 mSDtfsCounter, 2384 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:42,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 776 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 20:23:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 20:23:42,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2025-03-16 20:23:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3495 states, 3493 states have (on average 1.5250501002004009) internal successors, (5327), 3494 states have internal predecessors, (5327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5327 transitions. [2025-03-16 20:23:42,214 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5327 transitions. Word has length 47 [2025-03-16 20:23:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 3495 states and 5327 transitions. [2025-03-16 20:23:42,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5327 transitions. [2025-03-16 20:23:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:42,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:42,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:23:42,216 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1434916046, now seen corresponding path program 1 times [2025-03-16 20:23:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950872866] [2025-03-16 20:23:42,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:42,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:42,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:42,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:42,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:23:42,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950872866] [2025-03-16 20:23:42,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950872866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:42,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:42,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7488988] [2025-03-16 20:23:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:42,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:42,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:42,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:42,340 INFO L87 Difference]: Start difference. First operand 3495 states and 5327 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:42,471 INFO L93 Difference]: Finished difference Result 8257 states and 12188 transitions. [2025-03-16 20:23:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:42,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:42,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:42,490 INFO L225 Difference]: With dead ends: 8257 [2025-03-16 20:23:42,490 INFO L226 Difference]: Without dead ends: 7391 [2025-03-16 20:23:42,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:42,495 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4635 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:42,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 3309 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2025-03-16 20:23:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 4535. [2025-03-16 20:23:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4533 states have (on average 1.5016545334215752) internal successors, (6807), 4534 states have internal predecessors, (6807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 6807 transitions. [2025-03-16 20:23:42,604 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 6807 transitions. Word has length 61 [2025-03-16 20:23:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:42,604 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 6807 transitions. [2025-03-16 20:23:42,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 6807 transitions. [2025-03-16 20:23:42,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:42,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:42,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:42,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:23:42,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:42,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:42,609 INFO L85 PathProgramCache]: Analyzing trace with hash -677875406, now seen corresponding path program 1 times [2025-03-16 20:23:42,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:42,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173156681] [2025-03-16 20:23:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:42,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:42,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:42,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:23:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173156681] [2025-03-16 20:23:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173156681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96968228] [2025-03-16 20:23:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:42,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:42,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:42,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:42,717 INFO L87 Difference]: Start difference. First operand 4535 states and 6807 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:42,911 INFO L93 Difference]: Finished difference Result 9465 states and 13916 transitions. [2025-03-16 20:23:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:42,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:42,937 INFO L225 Difference]: With dead ends: 9465 [2025-03-16 20:23:42,939 INFO L226 Difference]: Without dead ends: 8255 [2025-03-16 20:23:42,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:42,942 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4670 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 3326 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:42,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 3326 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8255 states. [2025-03-16 20:23:43,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8255 to 6175. [2025-03-16 20:23:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6175 states, 6173 states have (on average 1.4798315243803661) internal successors, (9135), 6174 states have internal predecessors, (9135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6175 states to 6175 states and 9135 transitions. [2025-03-16 20:23:43,185 INFO L78 Accepts]: Start accepts. Automaton has 6175 states and 9135 transitions. Word has length 61 [2025-03-16 20:23:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 6175 states and 9135 transitions. [2025-03-16 20:23:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 6175 states and 9135 transitions. [2025-03-16 20:23:43,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:43,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:43,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:43,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:23:43,188 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1227664334, now seen corresponding path program 1 times [2025-03-16 20:23:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:43,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981011817] [2025-03-16 20:23:43,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:43,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:43,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:43,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:43,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:23:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981011817] [2025-03-16 20:23:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981011817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467080603] [2025-03-16 20:23:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:43,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:43,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:43,314 INFO L87 Difference]: Start difference. First operand 6175 states and 9135 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:43,480 INFO L93 Difference]: Finished difference Result 10673 states and 15636 transitions. [2025-03-16 20:23:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:43,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:43,499 INFO L225 Difference]: With dead ends: 10673 [2025-03-16 20:23:43,499 INFO L226 Difference]: Without dead ends: 9463 [2025-03-16 20:23:43,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:43,505 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 4667 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:43,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3328 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9463 states. [2025-03-16 20:23:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9463 to 7383. [2025-03-16 20:23:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7383 states, 7381 states have (on average 1.4706679311746376) internal successors, (10855), 7382 states have internal predecessors, (10855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7383 states to 7383 states and 10855 transitions. [2025-03-16 20:23:43,699 INFO L78 Accepts]: Start accepts. Automaton has 7383 states and 10855 transitions. Word has length 61 [2025-03-16 20:23:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:43,699 INFO L471 AbstractCegarLoop]: Abstraction has 7383 states and 10855 transitions. [2025-03-16 20:23:43,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7383 states and 10855 transitions. [2025-03-16 20:23:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:23:43,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:43,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:43,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:23:43,701 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:43,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -611693006, now seen corresponding path program 1 times [2025-03-16 20:23:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688265818] [2025-03-16 20:23:43,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:43,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:23:43,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:23:43,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:43,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:23:43,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688265818] [2025-03-16 20:23:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688265818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:23:43,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65465706] [2025-03-16 20:23:43,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:43,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:23:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:43,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:23:43,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:23:43,800 INFO L87 Difference]: Start difference. First operand 7383 states and 10855 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:44,003 INFO L93 Difference]: Finished difference Result 11881 states and 17356 transitions. [2025-03-16 20:23:44,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:23:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:23:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:44,018 INFO L225 Difference]: With dead ends: 11881 [2025-03-16 20:23:44,018 INFO L226 Difference]: Without dead ends: 10671 [2025-03-16 20:23:44,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:23:44,022 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 4637 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 3362 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:44,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 3362 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10671 states. [2025-03-16 20:23:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10671 to 8591. [2025-03-16 20:23:44,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4640819653044592) internal successors, (12575), 8590 states have internal predecessors, (12575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12575 transitions. [2025-03-16 20:23:44,177 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12575 transitions. Word has length 61 [2025-03-16 20:23:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:44,177 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12575 transitions. [2025-03-16 20:23:44,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12575 transitions. [2025-03-16 20:23:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:23:44,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:44,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:44,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:23:44,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 31261546, now seen corresponding path program 1 times [2025-03-16 20:23:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055199162] [2025-03-16 20:23:44,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:44,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:23:44,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:23:44,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:44,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:44,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055199162] [2025-03-16 20:23:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055199162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565980940] [2025-03-16 20:23:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:44,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:44,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:44,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:44,254 INFO L87 Difference]: Start difference. First operand 8591 states and 12575 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:44,388 INFO L93 Difference]: Finished difference Result 14899 states and 21569 transitions. [2025-03-16 20:23:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:44,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-16 20:23:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:44,422 INFO L225 Difference]: With dead ends: 14899 [2025-03-16 20:23:44,422 INFO L226 Difference]: Without dead ends: 8593 [2025-03-16 20:23:44,433 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 20:23:44,434 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 37 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 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 20:23:44,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8593 states. [2025-03-16 20:23:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8593 to 8591. [2025-03-16 20:23:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8591 states, 8589 states have (on average 1.4496448946326697) internal successors, (12451), 8590 states have internal predecessors, (12451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8591 states to 8591 states and 12451 transitions. [2025-03-16 20:23:44,625 INFO L78 Accepts]: Start accepts. Automaton has 8591 states and 12451 transitions. Word has length 62 [2025-03-16 20:23:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:44,625 INFO L471 AbstractCegarLoop]: Abstraction has 8591 states and 12451 transitions. [2025-03-16 20:23:44,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8591 states and 12451 transitions. [2025-03-16 20:23:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:23:44,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:44,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:44,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:23:44,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:44,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash 610722996, now seen corresponding path program 1 times [2025-03-16 20:23:44,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:44,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817401836] [2025-03-16 20:23:44,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:44,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:23:44,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:23:44,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:44,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:44,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817401836] [2025-03-16 20:23:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817401836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998758590] [2025-03-16 20:23:44,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:44,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:44,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:44,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:44,711 INFO L87 Difference]: Start difference. First operand 8591 states and 12451 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:44,762 INFO L93 Difference]: Finished difference Result 10987 states and 15858 transitions. [2025-03-16 20:23:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:23:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:44,770 INFO L225 Difference]: With dead ends: 10987 [2025-03-16 20:23:44,770 INFO L226 Difference]: Without dead ends: 4681 [2025-03-16 20:23:44,776 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 20:23:44,776 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 31 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3055 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 20:23:44,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3055 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2025-03-16 20:23:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4674. [2025-03-16 20:23:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4672 states have (on average 1.4850171232876712) internal successors, (6938), 4673 states have internal predecessors, (6938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6938 transitions. [2025-03-16 20:23:44,869 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6938 transitions. Word has length 63 [2025-03-16 20:23:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:44,869 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6938 transitions. [2025-03-16 20:23:44,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6938 transitions. [2025-03-16 20:23:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:23:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:44,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:44,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:23:44,871 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:44,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 106290851, now seen corresponding path program 1 times [2025-03-16 20:23:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579136776] [2025-03-16 20:23:44,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:44,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:44,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:23:44,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:23:44,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:44,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:44,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:44,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579136776] [2025-03-16 20:23:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579136776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:44,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444394388] [2025-03-16 20:23:44,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:44,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:44,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:44,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:44,933 INFO L87 Difference]: Start difference. First operand 4674 states and 6938 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:44,962 INFO L93 Difference]: Finished difference Result 5866 states and 8612 transitions. [2025-03-16 20:23:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:44,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:23:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:44,968 INFO L225 Difference]: With dead ends: 5866 [2025-03-16 20:23:44,968 INFO L226 Difference]: Without dead ends: 3488 [2025-03-16 20:23:44,970 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 20:23:44,970 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 33 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3034 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 20:23:44,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-16 20:23:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2025-03-16 20:23:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3484 states have (on average 1.505166475315729) internal successors, (5244), 3485 states have internal predecessors, (5244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 5244 transitions. [2025-03-16 20:23:45,007 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 5244 transitions. Word has length 64 [2025-03-16 20:23:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:45,008 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 5244 transitions. [2025-03-16 20:23:45,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 5244 transitions. [2025-03-16 20:23:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:23:45,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:45,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:45,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:23:45,009 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:45,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1930173660, now seen corresponding path program 1 times [2025-03-16 20:23:45,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:45,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660518583] [2025-03-16 20:23:45,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:45,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:23:45,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:23:45,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:45,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:45,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660518583] [2025-03-16 20:23:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660518583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:23:45,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:23:45,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:23:45,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954205020] [2025-03-16 20:23:45,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:23:45,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:23:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:45,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:23:45,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:23:45,062 INFO L87 Difference]: Start difference. First operand 3486 states and 5244 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:45,084 INFO L93 Difference]: Finished difference Result 4084 states and 6071 transitions. [2025-03-16 20:23:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:23:45,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:23:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:45,089 INFO L225 Difference]: With dead ends: 4084 [2025-03-16 20:23:45,089 INFO L226 Difference]: Without dead ends: 2894 [2025-03-16 20:23:45,090 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 20:23:45,090 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 30 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3019 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 20:23:45,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:23:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2025-03-16 20:23:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2025-03-16 20:23:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2890 states have (on average 1.5252595155709343) internal successors, (4408), 2891 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4408 transitions. [2025-03-16 20:23:45,116 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4408 transitions. Word has length 66 [2025-03-16 20:23:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:45,116 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 4408 transitions. [2025-03-16 20:23:45,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4408 transitions. [2025-03-16 20:23:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:23:45,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:45,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:23:45,117 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 103108117, now seen corresponding path program 1 times [2025-03-16 20:23:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254760909] [2025-03-16 20:23:45,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:45,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:45,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:23:45,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:23:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:46,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254760909] [2025-03-16 20:23:46,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254760909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:46,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822977049] [2025-03-16 20:23:46,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:46,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:46,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:46,197 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 20:23:46,198 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 20:23:46,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:23:46,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:23:46,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:46,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:46,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:23:46,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:46,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822977049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:47,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-03-16 20:23:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645331885] [2025-03-16 20:23:47,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:47,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 20:23:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:47,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 20:23:47,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-03-16 20:23:47,415 INFO L87 Difference]: Start difference. First operand 2892 states and 4408 transitions. Second operand has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:47,929 INFO L93 Difference]: Finished difference Result 4152 states and 6138 transitions. [2025-03-16 20:23:47,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 20:23:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:23:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:47,935 INFO L225 Difference]: With dead ends: 4152 [2025-03-16 20:23:47,935 INFO L226 Difference]: Without dead ends: 3556 [2025-03-16 20:23:47,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1155, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 20:23:47,939 INFO L435 NwaCegarLoop]: 1495 mSDtfsCounter, 15082 mSDsluCounter, 6277 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15082 SdHoareTripleChecker+Valid, 7772 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:47,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15082 Valid, 7772 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:23:47,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3556 states. [2025-03-16 20:23:47,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3556 to 3530. [2025-03-16 20:23:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3530 states, 3528 states have (on average 1.4895124716553287) internal successors, (5255), 3529 states have internal predecessors, (5255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3530 states to 3530 states and 5255 transitions. [2025-03-16 20:23:47,990 INFO L78 Accepts]: Start accepts. Automaton has 3530 states and 5255 transitions. Word has length 68 [2025-03-16 20:23:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:47,991 INFO L471 AbstractCegarLoop]: Abstraction has 3530 states and 5255 transitions. [2025-03-16 20:23:47,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.148148148148148) internal successors, (166), 26 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3530 states and 5255 transitions. [2025-03-16 20:23:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:23:47,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:47,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:47,999 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 20:23:48,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:48,198 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:48,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -263141404, now seen corresponding path program 1 times [2025-03-16 20:23:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714204438] [2025-03-16 20:23:48,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:48,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:48,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:48,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714204438] [2025-03-16 20:23:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714204438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921186019] [2025-03-16 20:23:48,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:48,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:48,460 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 20:23:48,461 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 20:23:48,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:48,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:48,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:48,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:48,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-16 20:23:48,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:49,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921186019] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-03-16 20:23:50,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195703548] [2025-03-16 20:23:50,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:50,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:23:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:23:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:23:50,338 INFO L87 Difference]: Start difference. First operand 3530 states and 5255 transitions. Second operand has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:51,402 INFO L93 Difference]: Finished difference Result 7458 states and 10552 transitions. [2025-03-16 20:23:51,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 20:23:51,403 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 20:23:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:51,413 INFO L225 Difference]: With dead ends: 7458 [2025-03-16 20:23:51,413 INFO L226 Difference]: Without dead ends: 6224 [2025-03-16 20:23:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=698, Invalid=2382, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 20:23:51,418 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 9781 mSDsluCounter, 9578 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9781 SdHoareTripleChecker+Valid, 11088 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9781 Valid, 11088 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:23:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2025-03-16 20:23:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6082. [2025-03-16 20:23:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6082 states, 6080 states have (on average 1.4179276315789473) internal successors, (8621), 6081 states have internal predecessors, (8621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 8621 transitions. [2025-03-16 20:23:51,513 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 8621 transitions. Word has length 69 [2025-03-16 20:23:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:51,513 INFO L471 AbstractCegarLoop]: Abstraction has 6082 states and 8621 transitions. [2025-03-16 20:23:51,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 8621 transitions. [2025-03-16 20:23:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 20:23:51,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:51,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:51,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:23:51,719 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,SelfDestructingSolverStorable20 [2025-03-16 20:23:51,719 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:51,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:51,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1865900900, now seen corresponding path program 1 times [2025-03-16 20:23:51,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:51,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059463693] [2025-03-16 20:23:51,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:51,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:52,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:52,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059463693] [2025-03-16 20:23:52,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059463693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:52,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564168202] [2025-03-16 20:23:52,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:52,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:52,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:52,007 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 20:23:52,031 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 20:23:52,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 20:23:52,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 20:23:52,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:52,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:52,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:23:52,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:52,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:52,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564168202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:52,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:23:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726538158] [2025-03-16 20:23:52,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:52,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:23:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:52,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:23:52,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:23:52,865 INFO L87 Difference]: Start difference. First operand 6082 states and 8621 transitions. Second operand has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:53,193 INFO L93 Difference]: Finished difference Result 13656 states and 18678 transitions. [2025-03-16 20:23:53,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:23:53,196 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-16 20:23:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:53,211 INFO L225 Difference]: With dead ends: 13656 [2025-03-16 20:23:53,211 INFO L226 Difference]: Without dead ends: 9870 [2025-03-16 20:23:53,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:23:53,217 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 11996 mSDsluCounter, 4682 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11996 SdHoareTripleChecker+Valid, 6178 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:53,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11996 Valid, 6178 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:23:53,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9870 states. [2025-03-16 20:23:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9870 to 9866. [2025-03-16 20:23:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9866 states, 9864 states have (on average 1.376926196269262) internal successors, (13582), 9865 states have internal predecessors, (13582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 13582 transitions. [2025-03-16 20:23:53,426 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 13582 transitions. Word has length 69 [2025-03-16 20:23:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:53,427 INFO L471 AbstractCegarLoop]: Abstraction has 9866 states and 13582 transitions. [2025-03-16 20:23:53,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.809523809523809) internal successors, (143), 20 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 13582 transitions. [2025-03-16 20:23:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:23:53,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:53,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:53,435 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 20:23:53,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:53,630 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:53,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1906622144, now seen corresponding path program 1 times [2025-03-16 20:23:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:53,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331705089] [2025-03-16 20:23:53,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:53,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:23:53,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:23:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:53,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331705089] [2025-03-16 20:23:53,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331705089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:53,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399489718] [2025-03-16 20:23:53,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:53,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:53,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:53,858 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 20:23:53,860 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 20:23:53,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:23:53,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:23:53,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:53,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:53,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:23:53,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:54,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:54,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399489718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:54,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:54,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-03-16 20:23:54,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479199042] [2025-03-16 20:23:54,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:54,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:23:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:54,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:23:54,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:23:54,960 INFO L87 Difference]: Start difference. First operand 9866 states and 13582 transitions. Second operand has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:55,725 INFO L93 Difference]: Finished difference Result 25800 states and 34749 transitions. [2025-03-16 20:23:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 20:23:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 20:23:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:55,751 INFO L225 Difference]: With dead ends: 25800 [2025-03-16 20:23:55,751 INFO L226 Difference]: Without dead ends: 18230 [2025-03-16 20:23:55,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=437, Invalid=1455, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:23:55,758 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 12172 mSDsluCounter, 7804 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12172 SdHoareTripleChecker+Valid, 9304 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:55,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12172 Valid, 9304 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:23:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18230 states. [2025-03-16 20:23:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18230 to 17962. [2025-03-16 20:23:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17962 states, 17960 states have (on average 1.3344097995545656) internal successors, (23966), 17961 states have internal predecessors, (23966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17962 states to 17962 states and 23966 transitions. [2025-03-16 20:23:56,306 INFO L78 Accepts]: Start accepts. Automaton has 17962 states and 23966 transitions. Word has length 70 [2025-03-16 20:23:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 17962 states and 23966 transitions. [2025-03-16 20:23:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.655172413793103) internal successors, (193), 29 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17962 states and 23966 transitions. [2025-03-16 20:23:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:23:56,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:56,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:23:56,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:23:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:56,509 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash 820241630, now seen corresponding path program 1 times [2025-03-16 20:23:56,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:56,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071918948] [2025-03-16 20:23:56,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:56,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:56,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:23:56,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:23:56,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:56,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:58,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071918948] [2025-03-16 20:23:58,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071918948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:58,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025014285] [2025-03-16 20:23:58,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:58,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:58,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:58,003 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 20:23:58,004 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 20:23:58,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:23:58,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:23:58,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:58,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:58,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-16 20:23:58,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:24:01,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:01,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:24:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:24:04,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025014285] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:24:04,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:24:04,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 62 [2025-03-16 20:24:04,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502676075] [2025-03-16 20:24:04,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:24:04,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-16 20:24:04,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:24:04,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-16 20:24:04,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=3435, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:24:04,658 INFO L87 Difference]: Start difference. First operand 17962 states and 23966 transitions. Second operand has 62 states, 62 states have (on average 3.129032258064516) internal successors, (194), 62 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)