./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.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 eb4732ffcc8aec7b756fbc1474109f3a44e8146c5a6c10619dc86e06d247c798 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:16:02,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:16:02,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:16:02,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:16:02,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:16:02,926 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:16:02,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:16:02,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:16:02,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:16:02,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:16:02,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:16:02,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:16:02,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:16:02,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:16:02,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:16:02,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:16:02,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:16:02,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:16:02,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:16:02,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:16:02,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:16:02,933 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 -> eb4732ffcc8aec7b756fbc1474109f3a44e8146c5a6c10619dc86e06d247c798 [2025-03-08 07:16:03,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:16:03,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:16:03,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:16:03,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:16:03,155 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:16:03,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-08 07:16:04,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023cba74d/a87c854fc4024bfebbdbfcdb437c55e2/FLAG3fbd87321 [2025-03-08 07:16:04,745 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:16:04,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-08 07:16:04,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023cba74d/a87c854fc4024bfebbdbfcdb437c55e2/FLAG3fbd87321 [2025-03-08 07:16:04,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/023cba74d/a87c854fc4024bfebbdbfcdb437c55e2 [2025-03-08 07:16:04,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:16:04,795 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:16:04,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:16:04,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:16:04,800 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:16:04,801 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:16:04" (1/1) ... [2025-03-08 07:16:04,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bab302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:04, skipping insertion in model container [2025-03-08 07:16:04,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:16:04" (1/1) ... [2025-03-08 07:16:04,887 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:16:05,141 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[8749,8762] [2025-03-08 07:16:05,191 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15810,15823] [2025-03-08 07:16:05,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:16:05,598 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:16:05,631 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[8749,8762] [2025-03-08 07:16:05,641 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.1.ufo.UNBOUNDED.pals+Problem12_label04.c[15810,15823] [2025-03-08 07:16:05,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:16:05,916 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:16:05,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05 WrapperNode [2025-03-08 07:16:05,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:16:05,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:16:05,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:16:05,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:16:05,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:05,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,176 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5034 [2025-03-08 07:16:06,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:16:06,177 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:16:06,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:16:06,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:16:06,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,332 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:16:06,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:16:06,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:16:06,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:16:06,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:16:06,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (1/1) ... [2025-03-08 07:16:06,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:16:06,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:06,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:16:06,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:16:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:16:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:16:06,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:16:06,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:16:06,660 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:16:06,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:16:10,185 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3537: havoc calculate_output2_#t~ret34#1; [2025-03-08 07:16:10,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5027: havoc calculate_output3_#t~ret35#1; [2025-03-08 07:16:10,186 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc calculate_output_#t~ret33#1; [2025-03-08 07:16:10,323 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-08 07:16:10,324 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:16:10,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:16:10,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:16:10,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:16:10 BoogieIcfgContainer [2025-03-08 07:16:10,358 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:16:10,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:16:10,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:16:10,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:16:10,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:16:04" (1/3) ... [2025-03-08 07:16:10,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd80110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:16:10, skipping insertion in model container [2025-03-08 07:16:10,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:16:05" (2/3) ... [2025-03-08 07:16:10,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd80110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:16:10, skipping insertion in model container [2025-03-08 07:16:10,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:16:10" (3/3) ... [2025-03-08 07:16:10,368 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c [2025-03-08 07:16:10,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:16:10,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals+Problem12_label04.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:16:10,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:16:10,465 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;@5d49f525, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:16:10,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:16:10,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 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-08 07:16:10,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:16:10,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:10,475 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] [2025-03-08 07:16:10,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:10,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1330764623, now seen corresponding path program 1 times [2025-03-08 07:16:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:10,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234698121] [2025-03-08 07:16:10,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:10,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:16:10,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:16:10,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:10,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:10,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234698121] [2025-03-08 07:16:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234698121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:10,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:16:10,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650395694] [2025-03-08 07:16:10,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:16:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:10,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:16:10,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:16:10,699 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-08 07:16:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:10,773 INFO L93 Difference]: Finished difference Result 1742 states and 3307 transitions. [2025-03-08 07:16:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:16:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2025-03-08 07:16:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:10,794 INFO L225 Difference]: With dead ends: 1742 [2025-03-08 07:16:10,794 INFO L226 Difference]: Without dead ends: 821 [2025-03-08 07:16:10,802 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-08 07:16:10,806 INFO L435 NwaCegarLoop]: 1615 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, 1615 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:10,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:10,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-08 07:16:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-03-08 07:16:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8937728937728937) internal successors, (1551), 820 states have internal predecessors, (1551), 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-08 07:16:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1551 transitions. [2025-03-08 07:16:10,880 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1551 transitions. Word has length 22 [2025-03-08 07:16:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:10,882 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1551 transitions. [2025-03-08 07:16:10,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-08 07:16:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1551 transitions. [2025-03-08 07:16:10,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 07:16:10,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:10,883 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] [2025-03-08 07:16:10,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:16:10,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:10,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-03-08 07:16:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:10,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786362981] [2025-03-08 07:16:10,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:10,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 07:16:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 07:16:10,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:10,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:11,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:11,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786362981] [2025-03-08 07:16:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786362981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:11,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:16:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118515332] [2025-03-08 07:16:11,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:11,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:16:11,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:11,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:16:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:11,101 INFO L87 Difference]: Start difference. First operand 821 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 07:16:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:11,183 INFO L93 Difference]: Finished difference Result 863 states and 1615 transitions. [2025-03-08 07:16:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:16:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-03-08 07:16:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:11,187 INFO L225 Difference]: With dead ends: 863 [2025-03-08 07:16:11,187 INFO L226 Difference]: Without dead ends: 821 [2025-03-08 07:16:11,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:11,188 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:11,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-03-08 07:16:11,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 821. [2025-03-08 07:16:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 819 states have (on average 1.8656898656898657) internal successors, (1528), 820 states have internal predecessors, (1528), 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-08 07:16:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1528 transitions. [2025-03-08 07:16:11,249 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1528 transitions. Word has length 22 [2025-03-08 07:16:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:11,250 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1528 transitions. [2025-03-08 07:16:11,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-08 07:16:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1528 transitions. [2025-03-08 07:16:11,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 07:16:11,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:11,254 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-08 07:16:11,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:16:11,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:11,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:11,256 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-03-08 07:16:11,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:11,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662430152] [2025-03-08 07:16:11,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:11,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 07:16:11,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 07:16:11,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:11,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:11,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:11,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662430152] [2025-03-08 07:16:11,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662430152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:11,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:11,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578128364] [2025-03-08 07:16:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:11,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:11,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:11,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:11,453 INFO L87 Difference]: Start difference. First operand 821 states and 1528 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-08 07:16:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:11,641 INFO L93 Difference]: Finished difference Result 1125 states and 2008 transitions. [2025-03-08 07:16:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:16:11,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-08 07:16:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:11,648 INFO L225 Difference]: With dead ends: 1125 [2025-03-08 07:16:11,648 INFO L226 Difference]: Without dead ends: 1087 [2025-03-08 07:16:11,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 07:16:11,651 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:11,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:16:11,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-08 07:16:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 857. [2025-03-08 07:16:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 855 states have (on average 1.8538011695906433) internal successors, (1585), 856 states have internal predecessors, (1585), 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-08 07:16:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1585 transitions. [2025-03-08 07:16:11,682 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1585 transitions. Word has length 44 [2025-03-08 07:16:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:11,683 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1585 transitions. [2025-03-08 07:16:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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-08 07:16:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1585 transitions. [2025-03-08 07:16:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:16:11,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:11,685 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] [2025-03-08 07:16:11,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:16:11,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:11,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:11,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-03-08 07:16:11,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:11,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224723821] [2025-03-08 07:16:11,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:11,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:16:11,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:16:11,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:11,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224723821] [2025-03-08 07:16:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224723821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360602300] [2025-03-08 07:16:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:11,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:11,792 INFO L87 Difference]: Start difference. First operand 857 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-08 07:16:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:11,819 INFO L93 Difference]: Finished difference Result 994 states and 1800 transitions. [2025-03-08 07:16:11,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:11,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2025-03-08 07:16:11,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:11,824 INFO L225 Difference]: With dead ends: 994 [2025-03-08 07:16:11,824 INFO L226 Difference]: Without dead ends: 920 [2025-03-08 07:16:11,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:11,826 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:11,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-08 07:16:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 916. [2025-03-08 07:16:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8326039387308535) internal successors, (1675), 915 states have internal predecessors, (1675), 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-08 07:16:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1675 transitions. [2025-03-08 07:16:11,845 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1675 transitions. Word has length 46 [2025-03-08 07:16:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:11,846 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1675 transitions. [2025-03-08 07:16:11,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-08 07:16:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1675 transitions. [2025-03-08 07:16:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 07:16:11,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:11,849 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] [2025-03-08 07:16:11,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:16:11,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:11,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:11,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-03-08 07:16:11,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:11,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121633799] [2025-03-08 07:16:11,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:11,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:11,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 07:16:11,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 07:16:11,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:11,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121633799] [2025-03-08 07:16:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121633799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083906175] [2025-03-08 07:16:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:12,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:12,062 INFO L87 Difference]: Start difference. First operand 916 states and 1675 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-08 07:16:12,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,155 INFO L93 Difference]: Finished difference Result 1051 states and 1883 transitions. [2025-03-08 07:16:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:12,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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 46 [2025-03-08 07:16:12,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,159 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 07:16:12,159 INFO L226 Difference]: Without dead ends: 918 [2025-03-08 07:16:12,159 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-08 07:16:12,160 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 2974 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:12,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 1693 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-08 07:16:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 916. [2025-03-08 07:16:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8304157549234135) internal successors, (1673), 915 states have internal predecessors, (1673), 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-08 07:16:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1673 transitions. [2025-03-08 07:16:12,178 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1673 transitions. Word has length 46 [2025-03-08 07:16:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,178 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1673 transitions. [2025-03-08 07:16:12,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 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-08 07:16:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1673 transitions. [2025-03-08 07:16:12,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 07:16:12,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,180 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-08 07:16:12,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:16:12,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-03-08 07:16:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517575491] [2025-03-08 07:16:12,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 07:16:12,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 07:16:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517575491] [2025-03-08 07:16:12,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517575491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:16:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889206034] [2025-03-08 07:16:12,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:16:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:16:12,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:12,358 INFO L87 Difference]: Start difference. First operand 916 states and 1673 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 07:16:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,390 INFO L93 Difference]: Finished difference Result 924 states and 1682 transitions. [2025-03-08 07:16:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:16:12,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 07:16:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,393 INFO L225 Difference]: With dead ends: 924 [2025-03-08 07:16:12,393 INFO L226 Difference]: Without dead ends: 922 [2025-03-08 07:16:12,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:16:12,394 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:12,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-08 07:16:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2025-03-08 07:16:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 920 states have (on average 1.8239130434782609) internal successors, (1678), 921 states have internal predecessors, (1678), 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-08 07:16:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1678 transitions. [2025-03-08 07:16:12,411 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1678 transitions. Word has length 47 [2025-03-08 07:16:12,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,411 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1678 transitions. [2025-03-08 07:16:12,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-08 07:16:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1678 transitions. [2025-03-08 07:16:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:12,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,412 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, 1] [2025-03-08 07:16:12,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:16:12,412 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,412 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-03-08 07:16:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799833493] [2025-03-08 07:16:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:12,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799833493] [2025-03-08 07:16:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799833493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127647417] [2025-03-08 07:16:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,476 INFO L87 Difference]: Start difference. First operand 922 states and 1678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,502 INFO L93 Difference]: Finished difference Result 1184 states and 2070 transitions. [2025-03-08 07:16:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:16:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,507 INFO L225 Difference]: With dead ends: 1184 [2025-03-08 07:16:12,507 INFO L226 Difference]: Without dead ends: 1045 [2025-03-08 07:16:12,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,509 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 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-08 07:16:12,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-03-08 07:16:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1043. [2025-03-08 07:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 1041 states have (on average 1.781940441882805) internal successors, (1855), 1042 states have internal predecessors, (1855), 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-08 07:16:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1855 transitions. [2025-03-08 07:16:12,536 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1855 transitions. Word has length 48 [2025-03-08 07:16:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,537 INFO L471 AbstractCegarLoop]: Abstraction has 1043 states and 1855 transitions. [2025-03-08 07:16:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1855 transitions. [2025-03-08 07:16:12,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:12,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,539 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, 1] [2025-03-08 07:16:12,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:16:12,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,539 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-03-08 07:16:12,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172284769] [2025-03-08 07:16:12,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:12,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:12,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172284769] [2025-03-08 07:16:12,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172284769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:12,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287805813] [2025-03-08 07:16:12,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,596 INFO L87 Difference]: Start difference. First operand 1043 states and 1855 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,628 INFO L93 Difference]: Finished difference Result 1531 states and 2573 transitions. [2025-03-08 07:16:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:12,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:16:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,633 INFO L225 Difference]: With dead ends: 1531 [2025-03-08 07:16:12,634 INFO L226 Difference]: Without dead ends: 1271 [2025-03-08 07:16:12,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,634 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 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-08 07:16:12,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2025-03-08 07:16:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1269. [2025-03-08 07:16:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1267 states have (on average 1.718232044198895) internal successors, (2177), 1268 states have internal predecessors, (2177), 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-08 07:16:12,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2177 transitions. [2025-03-08 07:16:12,657 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2177 transitions. Word has length 48 [2025-03-08 07:16:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 2177 transitions. [2025-03-08 07:16:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2177 transitions. [2025-03-08 07:16:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 07:16:12,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,658 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, 1] [2025-03-08 07:16:12,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:16:12,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,659 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-03-08 07:16:12,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875661381] [2025-03-08 07:16:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 07:16:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 07:16:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875661381] [2025-03-08 07:16:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875661381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:12,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519390597] [2025-03-08 07:16:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,707 INFO L87 Difference]: Start difference. First operand 1269 states and 2177 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,734 INFO L93 Difference]: Finished difference Result 2177 states and 3483 transitions. [2025-03-08 07:16:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-08 07:16:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,741 INFO L225 Difference]: With dead ends: 2177 [2025-03-08 07:16:12,742 INFO L226 Difference]: Without dead ends: 1691 [2025-03-08 07:16:12,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,745 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 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-08 07:16:12,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2025-03-08 07:16:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1689. [2025-03-08 07:16:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.6342620035566093) internal successors, (2757), 1688 states have internal predecessors, (2757), 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-08 07:16:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2757 transitions. [2025-03-08 07:16:12,775 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2757 transitions. Word has length 48 [2025-03-08 07:16:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,775 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2757 transitions. [2025-03-08 07:16:12,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-08 07:16:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2757 transitions. [2025-03-08 07:16:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 07:16:12,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,775 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, 1, 1, 1] [2025-03-08 07:16:12,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:16:12,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-03-08 07:16:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217269364] [2025-03-08 07:16:12,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 07:16:12,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 07:16:12,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217269364] [2025-03-08 07:16:12,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217269364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:12,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034969739] [2025-03-08 07:16:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,811 INFO L87 Difference]: Start difference. First operand 1689 states and 2757 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 07:16:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:12,843 INFO L93 Difference]: Finished difference Result 2656 states and 4155 transitions. [2025-03-08 07:16:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:12,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2025-03-08 07:16:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:12,850 INFO L225 Difference]: With dead ends: 2656 [2025-03-08 07:16:12,850 INFO L226 Difference]: Without dead ends: 2125 [2025-03-08 07:16:12,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,852 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 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-08 07:16:12,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2025-03-08 07:16:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2123. [2025-03-08 07:16:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2123 states, 2121 states have (on average 1.5836869401225837) internal successors, (3359), 2122 states have internal predecessors, (3359), 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-08 07:16:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 3359 transitions. [2025-03-08 07:16:12,893 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 3359 transitions. Word has length 50 [2025-03-08 07:16:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:12,893 INFO L471 AbstractCegarLoop]: Abstraction has 2123 states and 3359 transitions. [2025-03-08 07:16:12,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-08 07:16:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3359 transitions. [2025-03-08 07:16:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 07:16:12,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:12,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:12,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:16:12,894 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:12,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1719050336, now seen corresponding path program 1 times [2025-03-08 07:16:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256955192] [2025-03-08 07:16:12,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:12,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:12,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 07:16:12,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 07:16:12,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:12,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256955192] [2025-03-08 07:16:12,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256955192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:12,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:12,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:16:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702029599] [2025-03-08 07:16:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:12,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:12,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:12,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:12,948 INFO L87 Difference]: Start difference. First operand 2123 states and 3359 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-08 07:16:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:15,828 INFO L93 Difference]: Finished difference Result 3627 states and 6232 transitions. [2025-03-08 07:16:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-08 07:16:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:15,844 INFO L225 Difference]: With dead ends: 3627 [2025-03-08 07:16:15,845 INFO L226 Difference]: Without dead ends: 2874 [2025-03-08 07:16:15,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:15,850 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 829 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:15,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 564 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 07:16:15,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2025-03-08 07:16:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2874. [2025-03-08 07:16:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.5104456824512535) internal successors, (4338), 2873 states have internal predecessors, (4338), 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-08 07:16:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4338 transitions. [2025-03-08 07:16:15,965 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4338 transitions. Word has length 61 [2025-03-08 07:16:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:15,965 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4338 transitions. [2025-03-08 07:16:15,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-08 07:16:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4338 transitions. [2025-03-08 07:16:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:15,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:15,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:15,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:16:15,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-03-08 07:16:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130022857] [2025-03-08 07:16:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:15,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:16:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130022857] [2025-03-08 07:16:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130022857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594112516] [2025-03-08 07:16:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:16,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:16,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:16,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:16,107 INFO L87 Difference]: Start difference. First operand 2874 states and 4338 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 07:16:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:16,233 INFO L93 Difference]: Finished difference Result 8524 states and 12295 transitions. [2025-03-08 07:16:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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 65 [2025-03-08 07:16:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:16,254 INFO L225 Difference]: With dead ends: 8524 [2025-03-08 07:16:16,254 INFO L226 Difference]: Without dead ends: 7186 [2025-03-08 07:16:16,258 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-08 07:16:16,258 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4663 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4663 SdHoareTripleChecker+Valid, 3368 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:16,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4663 Valid, 3368 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-03-08 07:16:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-03-08 07:16:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.4738593155893536) internal successors, (6202), 4209 states have internal predecessors, (6202), 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-08 07:16:16,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6202 transitions. [2025-03-08 07:16:16,353 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6202 transitions. Word has length 65 [2025-03-08 07:16:16,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:16,354 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6202 transitions. [2025-03-08 07:16:16,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-08 07:16:16,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6202 transitions. [2025-03-08 07:16:16,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:16,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:16,355 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:16,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:16:16,355 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:16,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:16,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-03-08 07:16:16,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108323300] [2025-03-08 07:16:16,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:16,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:16,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:16,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:16,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:16,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:16:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108323300] [2025-03-08 07:16:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108323300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640191787] [2025-03-08 07:16:16,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:16,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:16,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:16,456 INFO L87 Difference]: Start difference. First operand 4210 states and 6202 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-08 07:16:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:16,615 INFO L93 Difference]: Finished difference Result 9860 states and 14159 transitions. [2025-03-08 07:16:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:16,615 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 65 [2025-03-08 07:16:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:16,633 INFO L225 Difference]: With dead ends: 9860 [2025-03-08 07:16:16,633 INFO L226 Difference]: Without dead ends: 8522 [2025-03-08 07:16:16,637 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-08 07:16:16,637 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4692 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4692 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:16,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4692 Valid, 3303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-03-08 07:16:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-03-08 07:16:16,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.4443371943371943) internal successors, (8978), 6217 states have internal predecessors, (8978), 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-08 07:16:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 8978 transitions. [2025-03-08 07:16:16,759 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 8978 transitions. Word has length 65 [2025-03-08 07:16:16,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:16,759 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 8978 transitions. [2025-03-08 07:16:16,760 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-08 07:16:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 8978 transitions. [2025-03-08 07:16:16,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 07:16:16,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:16,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:16,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:16:16,761 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:16,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:16,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-03-08 07:16:16,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:16,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088024080] [2025-03-08 07:16:16,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:16,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 07:16:16,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 07:16:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:16:16,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:16,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088024080] [2025-03-08 07:16:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088024080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705752191] [2025-03-08 07:16:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:16,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:16,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:16,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:16,854 INFO L87 Difference]: Start difference. First operand 6218 states and 8978 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-08 07:16:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:17,033 INFO L93 Difference]: Finished difference Result 11196 states and 16023 transitions. [2025-03-08 07:16:17,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:17,033 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 65 [2025-03-08 07:16:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:17,050 INFO L225 Difference]: With dead ends: 11196 [2025-03-08 07:16:17,050 INFO L226 Difference]: Without dead ends: 9858 [2025-03-08 07:16:17,054 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-08 07:16:17,055 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4677 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4677 SdHoareTripleChecker+Valid, 3324 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:17,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4677 Valid, 3324 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-03-08 07:16:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-03-08 07:16:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.435646186440678) internal successors, (10842), 7553 states have internal predecessors, (10842), 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-08 07:16:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 10842 transitions. [2025-03-08 07:16:17,198 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 10842 transitions. Word has length 65 [2025-03-08 07:16:17,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:17,199 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 10842 transitions. [2025-03-08 07:16:17,199 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-08 07:16:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 10842 transitions. [2025-03-08 07:16:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:16:17,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:17,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:17,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:16:17,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:17,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:17,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-03-08 07:16:17,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:17,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895121410] [2025-03-08 07:16:17,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:17,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:17,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:16:17,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:16:17,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:17,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895121410] [2025-03-08 07:16:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895121410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:17,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:17,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268727435] [2025-03-08 07:16:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:17,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:17,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:17,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:17,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:17,301 INFO L87 Difference]: Start difference. First operand 7554 states and 10842 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 07:16:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:17,365 INFO L93 Difference]: Finished difference Result 11896 states and 16983 transitions. [2025-03-08 07:16:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:17,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2025-03-08 07:16:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:17,375 INFO L225 Difference]: With dead ends: 11896 [2025-03-08 07:16:17,375 INFO L226 Difference]: Without dead ends: 5878 [2025-03-08 07:16:17,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:17,383 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 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-08 07:16:17,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2025-03-08 07:16:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2025-03-08 07:16:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5874 states have (on average 1.449778685733742) internal successors, (8516), 5875 states have internal predecessors, (8516), 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-08 07:16:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 8516 transitions. [2025-03-08 07:16:17,527 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 8516 transitions. Word has length 67 [2025-03-08 07:16:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:17,527 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 8516 transitions. [2025-03-08 07:16:17,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-08 07:16:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 8516 transitions. [2025-03-08 07:16:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 07:16:17,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:17,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:17,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:16:17,529 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-03-08 07:16:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:17,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32915190] [2025-03-08 07:16:17,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:17,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:17,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 07:16:17,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 07:16:17,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:17,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:17,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 07:16:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32915190] [2025-03-08 07:16:17,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32915190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:17,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:17,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:16:17,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080700857] [2025-03-08 07:16:17,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:16:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:16:17,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:16:17,742 INFO L87 Difference]: Start difference. First operand 5876 states and 8516 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-08 07:16:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:17,886 INFO L93 Difference]: Finished difference Result 9726 states and 13961 transitions. [2025-03-08 07:16:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 07:16:17,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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 67 [2025-03-08 07:16:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:17,901 INFO L225 Difference]: With dead ends: 9726 [2025-03-08 07:16:17,902 INFO L226 Difference]: Without dead ends: 8764 [2025-03-08 07:16:17,906 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-08 07:16:17,907 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4665 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:17,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 3404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:16:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2025-03-08 07:16:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 6836. [2025-03-08 07:16:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.4427860696517414) internal successors, (9860), 6835 states have internal predecessors, (9860), 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-08 07:16:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 9860 transitions. [2025-03-08 07:16:18,055 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 9860 transitions. Word has length 67 [2025-03-08 07:16:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,055 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 9860 transitions. [2025-03-08 07:16:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-08 07:16:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 9860 transitions. [2025-03-08 07:16:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 07:16:18,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:16:18,057 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-03-08 07:16:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117922006] [2025-03-08 07:16:18,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 07:16:18,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 07:16:18,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117922006] [2025-03-08 07:16:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117922006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308104158] [2025-03-08 07:16:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:18,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:18,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:18,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,136 INFO L87 Difference]: Start difference. First operand 6836 states and 9860 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 07:16:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:18,180 INFO L93 Difference]: Finished difference Result 9480 states and 13558 transitions. [2025-03-08 07:16:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 07:16:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:18,189 INFO L225 Difference]: With dead ends: 9480 [2025-03-08 07:16:18,189 INFO L226 Difference]: Without dead ends: 4198 [2025-03-08 07:16:18,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,196 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 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-08 07:16:18,196 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-08 07:16:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-03-08 07:16:18,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-03-08 07:16:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.4592274678111588) internal successors, (6120), 4195 states have internal predecessors, (6120), 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-08 07:16:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6120 transitions. [2025-03-08 07:16:18,253 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6120 transitions. Word has length 68 [2025-03-08 07:16:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6120 transitions. [2025-03-08 07:16:18,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-08 07:16:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6120 transitions. [2025-03-08 07:16:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 07:16:18,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,255 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:18,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:16:18,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-03-08 07:16:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293130537] [2025-03-08 07:16:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 07:16:18,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 07:16:18,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293130537] [2025-03-08 07:16:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293130537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645508495] [2025-03-08 07:16:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:18,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:18,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,336 INFO L87 Difference]: Start difference. First operand 4196 states and 6120 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 07:16:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:18,367 INFO L93 Difference]: Finished difference Result 5520 states and 7948 transitions. [2025-03-08 07:16:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 07:16:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:18,374 INFO L225 Difference]: With dead ends: 5520 [2025-03-08 07:16:18,374 INFO L226 Difference]: Without dead ends: 2878 [2025-03-08 07:16:18,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,379 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 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-08 07:16:18,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-03-08 07:16:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-03-08 07:16:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.4864300626304803) internal successors, (4272), 2875 states have internal predecessors, (4272), 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-08 07:16:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4272 transitions. [2025-03-08 07:16:18,454 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4272 transitions. Word has length 70 [2025-03-08 07:16:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4272 transitions. [2025-03-08 07:16:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-08 07:16:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4272 transitions. [2025-03-08 07:16:18,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 07:16:18,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:18,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:16:18,455 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-03-08 07:16:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664806117] [2025-03-08 07:16:18,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 07:16:18,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 07:16:18,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:18,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:18,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:18,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664806117] [2025-03-08 07:16:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664806117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:16:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:16:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:16:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212004236] [2025-03-08 07:16:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:16:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:16:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:16:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,535 INFO L87 Difference]: Start difference. First operand 2876 states and 4272 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 07:16:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:18,563 INFO L93 Difference]: Finished difference Result 3540 states and 5176 transitions. [2025-03-08 07:16:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:16:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-03-08 07:16:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:18,568 INFO L225 Difference]: With dead ends: 3540 [2025-03-08 07:16:18,568 INFO L226 Difference]: Without dead ends: 2218 [2025-03-08 07:16:18,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:16:18,569 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 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-08 07:16:18,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:16:18,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-03-08 07:16:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-03-08 07:16:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.517163504968383) internal successors, (3359), 2215 states have internal predecessors, (3359), 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-08 07:16:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3359 transitions. [2025-03-08 07:16:18,605 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3359 transitions. Word has length 72 [2025-03-08 07:16:18,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:18,605 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3359 transitions. [2025-03-08 07:16:18,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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-08 07:16:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3359 transitions. [2025-03-08 07:16:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 07:16:18,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:18,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:16:18,606 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:18,607 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-03-08 07:16:18,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:18,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919063682] [2025-03-08 07:16:18,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:18,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:16:18,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:16:18,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:18,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919063682] [2025-03-08 07:16:19,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919063682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:19,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458162731] [2025-03-08 07:16:19,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:19,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:19,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:19,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:16:19,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 07:16:19,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 07:16:19,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 07:16:19,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:19,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:19,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 07:16:20,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:20,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:20,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458162731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:20,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:20,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-08 07:16:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895639215] [2025-03-08 07:16:20,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 07:16:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:20,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 07:16:20,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-08 07:16:20,489 INFO L87 Difference]: Start difference. First operand 2216 states and 3359 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-08 07:16:23,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:23,848 INFO L93 Difference]: Finished difference Result 8272 states and 11407 transitions. [2025-03-08 07:16:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 07:16:23,849 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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 74 [2025-03-08 07:16:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:23,862 INFO L225 Difference]: With dead ends: 8272 [2025-03-08 07:16:23,862 INFO L226 Difference]: Without dead ends: 7536 [2025-03-08 07:16:23,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-08 07:16:23,867 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 17921 mSDsluCounter, 9418 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17921 SdHoareTripleChecker+Valid, 10935 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:23,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17921 Valid, 10935 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 07:16:23,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-03-08 07:16:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-03-08 07:16:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.3683911313246162) internal successors, (9628), 7037 states have internal predecessors, (9628), 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-08 07:16:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 9628 transitions. [2025-03-08 07:16:23,986 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 9628 transitions. Word has length 74 [2025-03-08 07:16:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:23,986 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 9628 transitions. [2025-03-08 07:16:23,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 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-08 07:16:23,987 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 9628 transitions. [2025-03-08 07:16:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 07:16:23,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:23,987 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:24,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:16:24,188 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-08 07:16:24,189 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:24,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1032286997, now seen corresponding path program 1 times [2025-03-08 07:16:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536147654] [2025-03-08 07:16:24,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:16:24,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:16:24,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:24,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536147654] [2025-03-08 07:16:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536147654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957276891] [2025-03-08 07:16:24,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:24,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:16:24,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 07:16:24,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 07:16:24,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 07:16:24,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:24,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:24,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:16:24,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:25,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:25,954 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:25,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957276891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:25,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:25,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-08 07:16:25,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857567373] [2025-03-08 07:16:25,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:25,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 07:16:25,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:25,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 07:16:25,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2025-03-08 07:16:25,955 INFO L87 Difference]: Start difference. First operand 7038 states and 9628 transitions. Second operand has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 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-08 07:16:28,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:16:28,976 INFO L93 Difference]: Finished difference Result 37895 states and 49812 transitions. [2025-03-08 07:16:28,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-08 07:16:28,977 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 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 75 [2025-03-08 07:16:28,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:16:29,016 INFO L225 Difference]: With dead ends: 37895 [2025-03-08 07:16:29,017 INFO L226 Difference]: Without dead ends: 32427 [2025-03-08 07:16:29,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1255, Invalid=5551, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 07:16:29,029 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 19577 mSDsluCounter, 15389 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19577 SdHoareTripleChecker+Valid, 16889 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:16:29,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19577 Valid, 16889 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:16:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32427 states. [2025-03-08 07:16:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32427 to 14341. [2025-03-08 07:16:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14341 states, 14339 states have (on average 1.3205941836948183) internal successors, (18936), 14340 states have internal predecessors, (18936), 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-08 07:16:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14341 states to 14341 states and 18936 transitions. [2025-03-08 07:16:29,615 INFO L78 Accepts]: Start accepts. Automaton has 14341 states and 18936 transitions. Word has length 75 [2025-03-08 07:16:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:16:29,615 INFO L471 AbstractCegarLoop]: Abstraction has 14341 states and 18936 transitions. [2025-03-08 07:16:29,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.90625) internal successors, (189), 32 states have internal predecessors, (189), 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-08 07:16:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 14341 states and 18936 transitions. [2025-03-08 07:16:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 07:16:29,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:16:29,617 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:16:29,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 07:16:29,817 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-08 07:16:29,818 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:16:29,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:16:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1144465886, now seen corresponding path program 1 times [2025-03-08 07:16:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:16:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52627930] [2025-03-08 07:16:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:16:29,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:16:29,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:16:29,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:29,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:16:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52627930] [2025-03-08 07:16:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52627930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:16:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670948486] [2025-03-08 07:16:30,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:16:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:16:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:16:30,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:16:30,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 07:16:30,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 07:16:30,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 07:16:30,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:16:30,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:16:30,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-08 07:16:30,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:16:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:32,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:16:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:16:33,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670948486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:16:33,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:16:33,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 16] total 41 [2025-03-08 07:16:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156791009] [2025-03-08 07:16:33,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:16:33,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 07:16:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:16:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 07:16:33,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1479, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 07:16:33,984 INFO L87 Difference]: Start difference. First operand 14341 states and 18936 transitions. Second operand has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 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-08 07:17:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:00,580 INFO L93 Difference]: Finished difference Result 79453 states and 102897 transitions. [2025-03-08 07:17:00,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2025-03-08 07:17:00,581 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 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 76 [2025-03-08 07:17:00,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:00,658 INFO L225 Difference]: With dead ends: 79453 [2025-03-08 07:17:00,658 INFO L226 Difference]: Without dead ends: 66982 [2025-03-08 07:17:00,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26372 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=8526, Invalid=56244, Unknown=0, NotChecked=0, Total=64770 [2025-03-08 07:17:00,683 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 32987 mSDsluCounter, 16349 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32987 SdHoareTripleChecker+Valid, 17878 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:00,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32987 Valid, 17878 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 07:17:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66982 states. [2025-03-08 07:17:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66982 to 24601. [2025-03-08 07:17:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24601 states, 24599 states have (on average 1.2950526444164396) internal successors, (31857), 24600 states have internal predecessors, (31857), 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-08 07:17:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24601 states to 24601 states and 31857 transitions. [2025-03-08 07:17:01,757 INFO L78 Accepts]: Start accepts. Automaton has 24601 states and 31857 transitions. Word has length 76 [2025-03-08 07:17:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:01,757 INFO L471 AbstractCegarLoop]: Abstraction has 24601 states and 31857 transitions. [2025-03-08 07:17:01,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 5.073170731707317) internal successors, (208), 41 states have internal predecessors, (208), 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-08 07:17:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 24601 states and 31857 transitions. [2025-03-08 07:17:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:17:01,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:01,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:17:01,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 07:17:01,959 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-08 07:17:01,959 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1286826896, now seen corresponding path program 1 times [2025-03-08 07:17:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534077860] [2025-03-08 07:17:01,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:01,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:17:01,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:17:01,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:02,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534077860] [2025-03-08 07:17:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534077860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168882853] [2025-03-08 07:17:02,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:02,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:02,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:02,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:17:02,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 07:17:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:17:02,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:17:02,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:02,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:02,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 07:17:02,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:03,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:17:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:04,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168882853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:17:04,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:17:04,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2025-03-08 07:17:04,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836438519] [2025-03-08 07:17:04,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:17:04,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 07:17:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:17:04,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 07:17:04,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-03-08 07:17:04,046 INFO L87 Difference]: Start difference. First operand 24601 states and 31857 transitions. Second operand has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 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-08 07:17:07,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:07,041 INFO L93 Difference]: Finished difference Result 51661 states and 65643 transitions. [2025-03-08 07:17:07,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 07:17:07,041 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 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 77 [2025-03-08 07:17:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:07,086 INFO L225 Difference]: With dead ends: 51661 [2025-03-08 07:17:07,086 INFO L226 Difference]: Without dead ends: 42684 [2025-03-08 07:17:07,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 07:17:07,097 INFO L435 NwaCegarLoop]: 1508 mSDtfsCounter, 8121 mSDsluCounter, 15687 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8121 SdHoareTripleChecker+Valid, 17195 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:07,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8121 Valid, 17195 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:17:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42684 states. [2025-03-08 07:17:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42684 to 29314. [2025-03-08 07:17:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29314 states, 29312 states have (on average 1.2849003820960698) internal successors, (37663), 29313 states have internal predecessors, (37663), 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-08 07:17:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29314 states to 29314 states and 37663 transitions. [2025-03-08 07:17:08,458 INFO L78 Accepts]: Start accepts. Automaton has 29314 states and 37663 transitions. Word has length 77 [2025-03-08 07:17:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:08,458 INFO L471 AbstractCegarLoop]: Abstraction has 29314 states and 37663 transitions. [2025-03-08 07:17:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.53125) internal successors, (209), 32 states have internal predecessors, (209), 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-08 07:17:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 29314 states and 37663 transitions. [2025-03-08 07:17:08,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 07:17:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:08,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:17:08,465 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-08 07:17:08,660 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-08 07:17:08,660 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:08,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1428629506, now seen corresponding path program 1 times [2025-03-08 07:17:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761123449] [2025-03-08 07:17:08,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:08,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:17:08,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:17:08,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:08,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761123449] [2025-03-08 07:17:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761123449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016181761] [2025-03-08 07:17:09,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:09,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:09,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:09,920 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:17:09,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 07:17:09,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 07:17:10,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 07:17:10,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:10,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:10,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 07:17:10,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:10,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 07:17:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:11,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016181761] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 07:17:11,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 07:17:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2025-03-08 07:17:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772378377] [2025-03-08 07:17:11,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 07:17:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 07:17:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:17:11,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 07:17:11,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 07:17:11,542 INFO L87 Difference]: Start difference. First operand 29314 states and 37663 transitions. Second operand has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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-08 07:17:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:17:21,805 INFO L93 Difference]: Finished difference Result 74767 states and 95568 transitions. [2025-03-08 07:17:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-08 07:17:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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 78 [2025-03-08 07:17:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:17:21,866 INFO L225 Difference]: With dead ends: 74767 [2025-03-08 07:17:21,867 INFO L226 Difference]: Without dead ends: 58893 [2025-03-08 07:17:21,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4922 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3561, Invalid=13731, Unknown=0, NotChecked=0, Total=17292 [2025-03-08 07:17:21,887 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 23963 mSDsluCounter, 22911 mSDsCounter, 0 mSdLazyCounter, 3338 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23963 SdHoareTripleChecker+Valid, 24466 SdHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 07:17:21,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23963 Valid, 24466 Invalid, 3421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 3338 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 07:17:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58893 states. [2025-03-08 07:17:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58893 to 19263. [2025-03-08 07:17:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19261 states have (on average 1.29998442448471) internal successors, (25039), 19262 states have internal predecessors, (25039), 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-08 07:17:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 25039 transitions. [2025-03-08 07:17:22,915 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 25039 transitions. Word has length 78 [2025-03-08 07:17:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:17:22,915 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 25039 transitions. [2025-03-08 07:17:22,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 4.326086956521739) internal successors, (199), 46 states have internal predecessors, (199), 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-08 07:17:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 25039 transitions. [2025-03-08 07:17:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:17:22,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:17:22,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:17:22,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 07:17:23,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 07:17:23,121 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:17:23,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:17:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1318695757, now seen corresponding path program 1 times [2025-03-08 07:17:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:17:23,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709070913] [2025-03-08 07:17:23,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:17:23,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:17:23,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:17:23,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:23,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:23,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:17:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709070913] [2025-03-08 07:17:23,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709070913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:17:23,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162531999] [2025-03-08 07:17:23,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:17:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:17:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:17:23,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:17:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 07:17:23,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:17:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:17:23,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:17:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:17:23,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 07:17:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:17:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:17:26,556 INFO L312 TraceCheckSpWp]: Computing backward predicates...