./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.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 4d62395951f99c0a3c43b690318a4d5480f589d72fceef9ee8ca741a4c7ef736 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:37:32,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:37:32,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:37:32,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:37:32,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:37:32,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:37:32,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:37:32,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:37:32,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:37:32,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:37:32,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:37:32,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:37:32,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:37:32,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:37:32,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:37:32,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:37:32,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:37:32,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:37:32,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:32,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:37:32,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:37:32,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:37:32,324 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 -> 4d62395951f99c0a3c43b690318a4d5480f589d72fceef9ee8ca741a4c7ef736 [2025-03-16 20:37:32,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:37:32,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:37:32,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:37:32,567 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:37:32,567 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:37:32,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:37:33,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a76679c/d7dfa86a5d6d45cbb6c14f1e7797bfe9/FLAGe6ad34046 [2025-03-16 20:37:34,134 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:37:34,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:37:34,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a76679c/d7dfa86a5d6d45cbb6c14f1e7797bfe9/FLAGe6ad34046 [2025-03-16 20:37:34,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36a76679c/d7dfa86a5d6d45cbb6c14f1e7797bfe9 [2025-03-16 20:37:34,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:37:34,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:37:34,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:34,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:37:34,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:37:34,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:34" (1/1) ... [2025-03-16 20:37:34,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304366dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:34, skipping insertion in model container [2025-03-16 20:37:34,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:37:34" (1/1) ... [2025-03-16 20:37:34,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:37:34,645 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[26888,26901] [2025-03-16 20:37:34,679 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[27730,27743] [2025-03-16 20:37:35,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:35,086 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:37:35,127 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[26888,26901] [2025-03-16 20:37:35,128 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.8.ufo.UNBOUNDED.pals+Problem12_label07.c[27730,27743] [2025-03-16 20:37:35,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:37:35,371 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:37:35,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35 WrapperNode [2025-03-16 20:37:35,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:37:35,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:35,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:37:35,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:37:35,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,698 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5285 [2025-03-16 20:37:35,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:37:35,700 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:37:35,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:37:35,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:37:35,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:37:35,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,977 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:35,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:36,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:36,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:36,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:37:36,082 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:37:36,082 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:37:36,082 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:37:36,083 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (1/1) ... [2025-03-16 20:37:36,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:37:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:37:36,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:37:36,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:37:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:37:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:37:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:37:36,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:37:36,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:37:36,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:37:39,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2025-03-16 20:37:39,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2025-03-16 20:37:39,479 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2025-03-16 20:37:39,668 INFO L? ?]: Removed 755 outVars from TransFormulas that were not future-live. [2025-03-16 20:37:39,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:37:39,699 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:37:39,702 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:37:39,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:39 BoogieIcfgContainer [2025-03-16 20:37:39,703 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:37:39,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:37:39,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:37:39,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:37:39,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:37:34" (1/3) ... [2025-03-16 20:37:39,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ad07f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:39, skipping insertion in model container [2025-03-16 20:37:39,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:37:35" (2/3) ... [2025-03-16 20:37:39,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ad07f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:37:39, skipping insertion in model container [2025-03-16 20:37:39,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:37:39" (3/3) ... [2025-03-16 20:37:39,711 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:37:39,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:37:39,723 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:37:39,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:37:39,801 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54267760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:37:39,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:37:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 20:37:39,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:39,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 20:37:39,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:39,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash -121825506, now seen corresponding path program 1 times [2025-03-16 20:37:39,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:39,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313224151] [2025-03-16 20:37:39,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:39,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:39,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 20:37:39,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 20:37:39,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:39,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:40,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:40,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313224151] [2025-03-16 20:37:40,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313224151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:37:40,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094397760] [2025-03-16 20:37:40,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:40,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:40,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:40,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:40,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:40,072 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9670828603859252) internal successors, (1733), 883 states have internal predecessors, (1733), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:42,682 INFO L93 Difference]: Finished difference Result 2458 states and 4839 transitions. [2025-03-16 20:37:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-03-16 20:37:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:42,698 INFO L225 Difference]: With dead ends: 2458 [2025-03-16 20:37:42,698 INFO L226 Difference]: Without dead ends: 1631 [2025-03-16 20:37:42,709 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-16 20:37:42,711 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 1038 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:42,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 310 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 20:37:42,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-16 20:37:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-16 20:37:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.865561694290976) internal successors, (3039), 1630 states have internal predecessors, (3039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:42,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 3039 transitions. [2025-03-16 20:37:42,797 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 3039 transitions. Word has length 6 [2025-03-16 20:37:42,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:42,797 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 3039 transitions. [2025-03-16 20:37:42,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 3039 transitions. [2025-03-16 20:37:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 20:37:42,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:42,798 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] [2025-03-16 20:37:42,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:37:42,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:42,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1205179400, now seen corresponding path program 1 times [2025-03-16 20:37:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:42,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676543297] [2025-03-16 20:37:42,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:42,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 20:37:42,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 20:37:42,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:43,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:43,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676543297] [2025-03-16 20:37:43,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676543297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:37:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495769916] [2025-03-16 20:37:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:43,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:43,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:43,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:43,078 INFO L87 Difference]: Start difference. First operand 1631 states and 3039 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:43,152 INFO L93 Difference]: Finished difference Result 1695 states and 3141 transitions. [2025-03-16 20:37:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:37:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-03-16 20:37:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:43,159 INFO L225 Difference]: With dead ends: 1695 [2025-03-16 20:37:43,159 INFO L226 Difference]: Without dead ends: 1631 [2025-03-16 20:37:43,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:43,161 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 0 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4924 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:43,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4924 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-16 20:37:43,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2025-03-16 20:37:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 1.8281154082259055) internal successors, (2978), 1630 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2978 transitions. [2025-03-16 20:37:43,196 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2978 transitions. Word has length 27 [2025-03-16 20:37:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:43,196 INFO L471 AbstractCegarLoop]: Abstraction has 1631 states and 2978 transitions. [2025-03-16 20:37:43,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2978 transitions. [2025-03-16 20:37:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 20:37:43,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:43,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:37:43,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 676411333, now seen corresponding path program 1 times [2025-03-16 20:37:43,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:43,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952923403] [2025-03-16 20:37:43,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:43,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 20:37:43,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 20:37:43,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:43,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:43,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952923403] [2025-03-16 20:37:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952923403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66235697] [2025-03-16 20:37:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:43,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:37:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:43,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:37:43,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:37:43,467 INFO L87 Difference]: Start difference. First operand 1631 states and 2978 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:47,293 INFO L93 Difference]: Finished difference Result 5396 states and 9984 transitions. [2025-03-16 20:37:47,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:37:47,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-03-16 20:37:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:47,304 INFO L225 Difference]: With dead ends: 5396 [2025-03-16 20:37:47,304 INFO L226 Difference]: Without dead ends: 3892 [2025-03-16 20:37:47,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:37:47,308 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2624 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:47,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 363 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 20:37:47,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2025-03-16 20:37:47,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3884. [2025-03-16 20:37:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3882 states have (on average 1.6027820710973726) internal successors, (6222), 3883 states have internal predecessors, (6222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 6222 transitions. [2025-03-16 20:37:47,365 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 6222 transitions. Word has length 79 [2025-03-16 20:37:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 3884 states and 6222 transitions. [2025-03-16 20:37:47,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 6222 transitions. [2025-03-16 20:37:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 20:37:47,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:47,369 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:47,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:37:47,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 113676108, now seen corresponding path program 1 times [2025-03-16 20:37:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144268235] [2025-03-16 20:37:47,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 20:37:47,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 20:37:47,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:47,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144268235] [2025-03-16 20:37:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144268235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714515516] [2025-03-16 20:37:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:47,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:47,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:47,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:47,664 INFO L87 Difference]: Start difference. First operand 3884 states and 6222 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:48,055 INFO L93 Difference]: Finished difference Result 4860 states and 7806 transitions. [2025-03-16 20:37:48,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 20:37:48,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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 87 [2025-03-16 20:37:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:48,072 INFO L225 Difference]: With dead ends: 4860 [2025-03-16 20:37:48,072 INFO L226 Difference]: Without dead ends: 4799 [2025-03-16 20:37:48,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-16 20:37:48,075 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 13460 mSDsluCounter, 4332 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13460 SdHoareTripleChecker+Valid, 5929 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:48,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13460 Valid, 5929 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:37:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4799 states. [2025-03-16 20:37:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4799 to 3943. [2025-03-16 20:37:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3941 states have (on average 1.6031464095407257) internal successors, (6318), 3942 states have internal predecessors, (6318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 6318 transitions. [2025-03-16 20:37:48,146 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 6318 transitions. Word has length 87 [2025-03-16 20:37:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:48,147 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 6318 transitions. [2025-03-16 20:37:48,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 6318 transitions. [2025-03-16 20:37:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:48,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:48,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:48,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:37:48,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:48,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1905739598, now seen corresponding path program 1 times [2025-03-16 20:37:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092336585] [2025-03-16 20:37:48,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:48,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:48,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:48,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:48,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092336585] [2025-03-16 20:37:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092336585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:48,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202206022] [2025-03-16 20:37:48,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:48,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:48,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:48,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:48,629 INFO L87 Difference]: Start difference. First operand 3943 states and 6318 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:48,946 INFO L93 Difference]: Finished difference Result 4065 states and 6514 transitions. [2025-03-16 20:37:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 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 89 [2025-03-16 20:37:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:48,959 INFO L225 Difference]: With dead ends: 4065 [2025-03-16 20:37:48,960 INFO L226 Difference]: Without dead ends: 3945 [2025-03-16 20:37:48,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-16 20:37:48,962 INFO L435 NwaCegarLoop]: 1593 mSDtfsCounter, 9126 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9126 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:48,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9126 Valid, 2274 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-16 20:37:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3943. [2025-03-16 20:37:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3943 states, 3941 states have (on average 1.6028926668358285) internal successors, (6317), 3942 states have internal predecessors, (6317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 6317 transitions. [2025-03-16 20:37:49,019 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 6317 transitions. Word has length 89 [2025-03-16 20:37:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:49,020 INFO L471 AbstractCegarLoop]: Abstraction has 3943 states and 6317 transitions. [2025-03-16 20:37:49,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 6317 transitions. [2025-03-16 20:37:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:37:49,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:49,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:49,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:37:49,022 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:49,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1904696913, now seen corresponding path program 1 times [2025-03-16 20:37:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027536520] [2025-03-16 20:37:49,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:49,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:37:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:37:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027536520] [2025-03-16 20:37:49,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027536520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:49,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:49,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:49,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527636768] [2025-03-16 20:37:49,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:49,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:49,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:49,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,154 INFO L87 Difference]: Start difference. First operand 3943 states and 6317 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:49,189 INFO L93 Difference]: Finished difference Result 4172 states and 6686 transitions. [2025-03-16 20:37:49,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:49,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 89 [2025-03-16 20:37:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:49,200 INFO L225 Difference]: With dead ends: 4172 [2025-03-16 20:37:49,201 INFO L226 Difference]: Without dead ends: 4052 [2025-03-16 20:37:49,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,203 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 1506 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1691 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-16 20:37:49,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1691 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:49,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2025-03-16 20:37:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 4048. [2025-03-16 20:37:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4046 states have (on average 1.6025704399406822) internal successors, (6484), 4047 states have internal predecessors, (6484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 6484 transitions. [2025-03-16 20:37:49,257 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 6484 transitions. Word has length 89 [2025-03-16 20:37:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:49,258 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 6484 transitions. [2025-03-16 20:37:49,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 6484 transitions. [2025-03-16 20:37:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 20:37:49,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:49,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:49,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:37:49,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:49,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1050629546, now seen corresponding path program 1 times [2025-03-16 20:37:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:49,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053095355] [2025-03-16 20:37:49,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:49,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 20:37:49,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 20:37:49,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:49,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:49,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053095355] [2025-03-16 20:37:49,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053095355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:49,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:49,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:37:49,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781796976] [2025-03-16 20:37:49,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:49,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:37:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:49,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:37:49,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:49,513 INFO L87 Difference]: Start difference. First operand 4048 states and 6484 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:49,584 INFO L93 Difference]: Finished difference Result 4054 states and 6491 transitions. [2025-03-16 20:37:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:37:49,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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 90 [2025-03-16 20:37:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:49,603 INFO L225 Difference]: With dead ends: 4054 [2025-03-16 20:37:49,603 INFO L226 Difference]: Without dead ends: 4052 [2025-03-16 20:37:49,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:37:49,605 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 0 mSDsluCounter, 6385 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7984 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:49,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7984 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2025-03-16 20:37:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 4052. [2025-03-16 20:37:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4052 states, 4050 states have (on average 1.6017283950617285) internal successors, (6487), 4051 states have internal predecessors, (6487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4052 states to 4052 states and 6487 transitions. [2025-03-16 20:37:49,666 INFO L78 Accepts]: Start accepts. Automaton has 4052 states and 6487 transitions. Word has length 90 [2025-03-16 20:37:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:49,666 INFO L471 AbstractCegarLoop]: Abstraction has 4052 states and 6487 transitions. [2025-03-16 20:37:49,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 4052 states and 6487 transitions. [2025-03-16 20:37:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:49,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:49,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:49,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:37:49,668 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1274985008, now seen corresponding path program 1 times [2025-03-16 20:37:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100514326] [2025-03-16 20:37:49,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:49,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:49,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:49,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:49,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:49,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100514326] [2025-03-16 20:37:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100514326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:49,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:49,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732920590] [2025-03-16 20:37:49,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:49,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:49,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,752 INFO L87 Difference]: Start difference. First operand 4052 states and 6487 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:49,783 INFO L93 Difference]: Finished difference Result 4494 states and 7187 transitions. [2025-03-16 20:37:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:49,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:49,793 INFO L225 Difference]: With dead ends: 4494 [2025-03-16 20:37:49,797 INFO L226 Difference]: Without dead ends: 4265 [2025-03-16 20:37:49,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,800 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1525 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:49,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1783 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4265 states. [2025-03-16 20:37:49,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4265 to 4263. [2025-03-16 20:37:49,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4263 states, 4261 states have (on average 1.600093874677306) internal successors, (6818), 4262 states have internal predecessors, (6818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6818 transitions. [2025-03-16 20:37:49,862 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6818 transitions. Word has length 91 [2025-03-16 20:37:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:49,862 INFO L471 AbstractCegarLoop]: Abstraction has 4263 states and 6818 transitions. [2025-03-16 20:37:49,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6818 transitions. [2025-03-16 20:37:49,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:49,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:49,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:49,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:37:49,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:49,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1254499024, now seen corresponding path program 1 times [2025-03-16 20:37:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:49,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36958742] [2025-03-16 20:37:49,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:49,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:49,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:49,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:49,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:49,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36958742] [2025-03-16 20:37:49,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36958742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:49,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:49,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:49,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990551645] [2025-03-16 20:37:49,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:49,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:49,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:49,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:49,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,929 INFO L87 Difference]: Start difference. First operand 4263 states and 6818 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:49,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:49,974 INFO L93 Difference]: Finished difference Result 5111 states and 8152 transitions. [2025-03-16 20:37:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:49,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:49,982 INFO L225 Difference]: With dead ends: 5111 [2025-03-16 20:37:49,982 INFO L226 Difference]: Without dead ends: 4671 [2025-03-16 20:37:49,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:49,985 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1523 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:49,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2025-03-16 20:37:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4669. [2025-03-16 20:37:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4669 states, 4667 states have (on average 1.5958860081422757) internal successors, (7448), 4668 states have internal predecessors, (7448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4669 states to 4669 states and 7448 transitions. [2025-03-16 20:37:50,048 INFO L78 Accepts]: Start accepts. Automaton has 4669 states and 7448 transitions. Word has length 91 [2025-03-16 20:37:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:50,049 INFO L471 AbstractCegarLoop]: Abstraction has 4669 states and 7448 transitions. [2025-03-16 20:37:50,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4669 states and 7448 transitions. [2025-03-16 20:37:50,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:50,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:50,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:50,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:37:50,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1759625264, now seen corresponding path program 1 times [2025-03-16 20:37:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:50,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172528641] [2025-03-16 20:37:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:50,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:50,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:50,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:50,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172528641] [2025-03-16 20:37:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172528641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289337185] [2025-03-16 20:37:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:50,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:50,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,112 INFO L87 Difference]: Start difference. First operand 4669 states and 7448 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:50,147 INFO L93 Difference]: Finished difference Result 6297 states and 9986 transitions. [2025-03-16 20:37:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:50,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:50,156 INFO L225 Difference]: With dead ends: 6297 [2025-03-16 20:37:50,156 INFO L226 Difference]: Without dead ends: 5451 [2025-03-16 20:37:50,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,159 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1521 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:50,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5451 states. [2025-03-16 20:37:50,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5451 to 5449. [2025-03-16 20:37:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5447 states have (on average 1.5869285845419496) internal successors, (8644), 5448 states have internal predecessors, (8644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8644 transitions. [2025-03-16 20:37:50,230 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8644 transitions. Word has length 91 [2025-03-16 20:37:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:50,230 INFO L471 AbstractCegarLoop]: Abstraction has 5449 states and 8644 transitions. [2025-03-16 20:37:50,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8644 transitions. [2025-03-16 20:37:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:50,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:50,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:50,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:37:50,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:50,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1691983056, now seen corresponding path program 1 times [2025-03-16 20:37:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201375836] [2025-03-16 20:37:50,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:50,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:50,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:50,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:50,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201375836] [2025-03-16 20:37:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201375836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739326597] [2025-03-16 20:37:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:50,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:50,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:50,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,291 INFO L87 Difference]: Start difference. First operand 5449 states and 8644 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:50,400 INFO L93 Difference]: Finished difference Result 8573 states and 13462 transitions. [2025-03-16 20:37:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:50,413 INFO L225 Difference]: With dead ends: 8573 [2025-03-16 20:37:50,414 INFO L226 Difference]: Without dead ends: 6947 [2025-03-16 20:37:50,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,417 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1519 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:50,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2025-03-16 20:37:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 6945. [2025-03-16 20:37:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6945 states, 6943 states have (on average 1.5710787843871525) internal successors, (10908), 6944 states have internal predecessors, (10908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6945 states to 6945 states and 10908 transitions. [2025-03-16 20:37:50,567 INFO L78 Accepts]: Start accepts. Automaton has 6945 states and 10908 transitions. Word has length 91 [2025-03-16 20:37:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:50,567 INFO L471 AbstractCegarLoop]: Abstraction has 6945 states and 10908 transitions. [2025-03-16 20:37:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6945 states and 10908 transitions. [2025-03-16 20:37:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:50,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:50,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:50,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:37:50,569 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:50,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -934942416, now seen corresponding path program 1 times [2025-03-16 20:37:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:50,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532727141] [2025-03-16 20:37:50,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:50,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:50,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:50,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:50,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:50,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:50,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:50,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532727141] [2025-03-16 20:37:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532727141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124470059] [2025-03-16 20:37:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:50,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:50,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,650 INFO L87 Difference]: Start difference. First operand 6945 states and 10908 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:50,760 INFO L93 Difference]: Finished difference Result 12933 states and 20030 transitions. [2025-03-16 20:37:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:50,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:50,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:50,779 INFO L225 Difference]: With dead ends: 12933 [2025-03-16 20:37:50,779 INFO L226 Difference]: Without dead ends: 9811 [2025-03-16 20:37:50,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:50,787 INFO L435 NwaCegarLoop]: 1661 mSDtfsCounter, 1515 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:50,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1785 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9811 states. [2025-03-16 20:37:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9811 to 9809. [2025-03-16 20:37:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9809 states, 9807 states have (on average 1.5478739675741817) internal successors, (15180), 9808 states have internal predecessors, (15180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9809 states to 9809 states and 15180 transitions. [2025-03-16 20:37:50,951 INFO L78 Accepts]: Start accepts. Automaton has 9809 states and 15180 transitions. Word has length 91 [2025-03-16 20:37:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 9809 states and 15180 transitions. [2025-03-16 20:37:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:50,952 INFO L276 IsEmpty]: Start isEmpty. Operand 9809 states and 15180 transitions. [2025-03-16 20:37:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:50,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:50,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:50,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:37:50,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:50,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:50,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1484731344, now seen corresponding path program 1 times [2025-03-16 20:37:50,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:50,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547174339] [2025-03-16 20:37:50,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:50,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:50,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:50,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:50,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547174339] [2025-03-16 20:37:51,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547174339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532168240] [2025-03-16 20:37:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:51,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:51,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:51,012 INFO L87 Difference]: Start difference. First operand 9809 states and 15180 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:51,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:51,223 INFO L93 Difference]: Finished difference Result 21269 states and 32398 transitions. [2025-03-16 20:37:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:51,251 INFO L225 Difference]: With dead ends: 21269 [2025-03-16 20:37:51,251 INFO L226 Difference]: Without dead ends: 15283 [2025-03-16 20:37:51,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:51,259 INFO L435 NwaCegarLoop]: 1659 mSDtfsCounter, 1513 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1787 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:51,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1787 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:51,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15283 states. [2025-03-16 20:37:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15283 to 15281. [2025-03-16 20:37:51,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15281 states, 15279 states have (on average 1.5192093723411217) internal successors, (23212), 15280 states have internal predecessors, (23212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:51,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15281 states to 15281 states and 23212 transitions. [2025-03-16 20:37:51,518 INFO L78 Accepts]: Start accepts. Automaton has 15281 states and 23212 transitions. Word has length 91 [2025-03-16 20:37:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:51,518 INFO L471 AbstractCegarLoop]: Abstraction has 15281 states and 23212 transitions. [2025-03-16 20:37:51,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15281 states and 23212 transitions. [2025-03-16 20:37:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:37:51,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:51,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:51,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:37:51,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:51,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash -868760016, now seen corresponding path program 1 times [2025-03-16 20:37:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:51,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930577232] [2025-03-16 20:37:51,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:51,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:51,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:37:51,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:37:51,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:51,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:51,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930577232] [2025-03-16 20:37:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930577232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849585171] [2025-03-16 20:37:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:51,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:51,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:51,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:51,579 INFO L87 Difference]: Start difference. First operand 15281 states and 23212 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:51,898 INFO L93 Difference]: Finished difference Result 37173 states and 55598 transitions. [2025-03-16 20:37:51,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:51,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2025-03-16 20:37:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:51,942 INFO L225 Difference]: With dead ends: 37173 [2025-03-16 20:37:51,943 INFO L226 Difference]: Without dead ends: 25715 [2025-03-16 20:37:51,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:51,958 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1517 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:51,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1791 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25715 states. [2025-03-16 20:37:52,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25715 to 25713. [2025-03-16 20:37:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25713 states, 25711 states have (on average 1.4877678814515187) internal successors, (38252), 25712 states have internal predecessors, (38252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25713 states to 25713 states and 38252 transitions. [2025-03-16 20:37:52,410 INFO L78 Accepts]: Start accepts. Automaton has 25713 states and 38252 transitions. Word has length 91 [2025-03-16 20:37:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 25713 states and 38252 transitions. [2025-03-16 20:37:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 25713 states and 38252 transitions. [2025-03-16 20:37:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:37:52,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:52,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:37:52,412 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:52,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -164853808, now seen corresponding path program 1 times [2025-03-16 20:37:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475709245] [2025-03-16 20:37:52,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:52,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:37:52,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:37:52,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:52,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:37:52,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:52,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475709245] [2025-03-16 20:37:52,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475709245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:52,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:37:52,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103124396] [2025-03-16 20:37:52,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:52,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:37:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:52,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:37:52,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:52,573 INFO L87 Difference]: Start difference. First operand 25713 states and 38252 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:52,902 INFO L93 Difference]: Finished difference Result 48248 states and 71794 transitions. [2025-03-16 20:37:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:37:52,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 93 [2025-03-16 20:37:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:52,966 INFO L225 Difference]: With dead ends: 48248 [2025-03-16 20:37:52,966 INFO L226 Difference]: Without dead ends: 36213 [2025-03-16 20:37:52,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:37:52,990 INFO L435 NwaCegarLoop]: 1684 mSDtfsCounter, 1524 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:52,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 1784 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:37:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36213 states. [2025-03-16 20:37:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36213 to 36211. [2025-03-16 20:37:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36211 states, 36209 states have (on average 1.4771465657709408) internal successors, (53486), 36210 states have internal predecessors, (53486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36211 states to 36211 states and 53486 transitions. [2025-03-16 20:37:53,944 INFO L78 Accepts]: Start accepts. Automaton has 36211 states and 53486 transitions. Word has length 93 [2025-03-16 20:37:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:37:53,945 INFO L471 AbstractCegarLoop]: Abstraction has 36211 states and 53486 transitions. [2025-03-16 20:37:53,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36211 states and 53486 transitions. [2025-03-16 20:37:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:37:53,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:37:53,951 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:37:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:37:53,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:37:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:37:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -675466654, now seen corresponding path program 1 times [2025-03-16 20:37:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:37:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963864245] [2025-03-16 20:37:53,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:37:53,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:37:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:37:53,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:37:53,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:37:53,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:37:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:37:54,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:37:54,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963864245] [2025-03-16 20:37:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963864245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:37:54,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:37:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:37:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609304072] [2025-03-16 20:37:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:37:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:37:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:37:54,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:37:54,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:37:54,239 INFO L87 Difference]: Start difference. First operand 36211 states and 53486 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:37:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:37:57,655 INFO L93 Difference]: Finished difference Result 301701 states and 441463 transitions. [2025-03-16 20:37:57,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:37:57,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 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 115 [2025-03-16 20:37:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:37:58,122 INFO L225 Difference]: With dead ends: 301701 [2025-03-16 20:37:58,122 INFO L226 Difference]: Without dead ends: 269315 [2025-03-16 20:37:58,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:37:58,209 INFO L435 NwaCegarLoop]: 1705 mSDtfsCounter, 11727 mSDsluCounter, 3457 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11727 SdHoareTripleChecker+Valid, 5162 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:37:58,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11727 Valid, 5162 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:37:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269315 states. [2025-03-16 20:38:01,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269315 to 68595. [2025-03-16 20:38:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68595 states, 68593 states have (on average 1.4646100914087443) internal successors, (100462), 68594 states have internal predecessors, (100462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:38:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68595 states to 68595 states and 100462 transitions. [2025-03-16 20:38:01,556 INFO L78 Accepts]: Start accepts. Automaton has 68595 states and 100462 transitions. Word has length 115 [2025-03-16 20:38:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:38:01,557 INFO L471 AbstractCegarLoop]: Abstraction has 68595 states and 100462 transitions. [2025-03-16 20:38:01,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:38:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68595 states and 100462 transitions. [2025-03-16 20:38:01,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:38:01,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:38:01,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:38:01,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:38:01,564 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:38:01,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:38:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1090016610, now seen corresponding path program 1 times [2025-03-16 20:38:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:38:01,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293909359] [2025-03-16 20:38:01,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:38:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:38:01,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:38:01,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:38:01,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:38:01,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:38:01,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:38:01,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:38:01,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293909359] [2025-03-16 20:38:01,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293909359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:38:01,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:38:01,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:38:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005869163] [2025-03-16 20:38:01,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:38:01,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:38:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:38:01,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:38:01,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:38:01,788 INFO L87 Difference]: Start difference. First operand 68595 states and 100462 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:38:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:38:06,717 INFO L93 Difference]: Finished difference Result 334085 states and 488439 transitions. [2025-03-16 20:38:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 20:38:06,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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 115 [2025-03-16 20:38:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:38:07,157 INFO L225 Difference]: With dead ends: 334085 [2025-03-16 20:38:07,157 INFO L226 Difference]: Without dead ends: 301699 [2025-03-16 20:38:07,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:38:07,221 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 11751 mSDsluCounter, 3298 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11751 SdHoareTripleChecker+Valid, 5000 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:38:07,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11751 Valid, 5000 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:38:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301699 states. [2025-03-16 20:38:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301699 to 117235. [2025-03-16 20:38:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117235 states, 117233 states have (on average 1.4552728327348101) internal successors, (170606), 117234 states have internal predecessors, (170606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:38:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117235 states to 117235 states and 170606 transitions. [2025-03-16 20:38:11,702 INFO L78 Accepts]: Start accepts. Automaton has 117235 states and 170606 transitions. Word has length 115 [2025-03-16 20:38:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:38:11,703 INFO L471 AbstractCegarLoop]: Abstraction has 117235 states and 170606 transitions. [2025-03-16 20:38:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:38:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 117235 states and 170606 transitions. [2025-03-16 20:38:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 20:38:11,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:38:11,710 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:38:11,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:38:11,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:38:11,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:38:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash -190826398, now seen corresponding path program 1 times [2025-03-16 20:38:11,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:38:11,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191953615] [2025-03-16 20:38:11,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:38:11,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:38:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 20:38:11,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 20:38:11,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:38:11,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:38:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:38:11,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:38:11,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191953615] [2025-03-16 20:38:11,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191953615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:38:11,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:38:11,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 20:38:11,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926814501] [2025-03-16 20:38:11,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:38:11,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 20:38:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:38:11,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 20:38:11,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 20:38:11,904 INFO L87 Difference]: Start difference. First operand 117235 states and 170606 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 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)