./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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.6.ufo.UNBOUNDED.pals+Problem12_label05.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 f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:13:35,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:13:35,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:13:35,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:13:35,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:13:35,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:13:35,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:13:35,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:13:35,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:13:35,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:13:35,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:13:35,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:13:35,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:13:35,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:13:35,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:13:35,297 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:13:35,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:13:35,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:13:35,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:13:35,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:13:35,298 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 -> f95bc0400f9e54d231740d68b8f60687442b1216917c3afc522bda656e30c0ed [2025-03-03 16:13:35,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:13:35,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:13:35,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:13:35,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:13:35,542 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:13:35,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:13:36,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15db7c03/2c8fd74edea341e1848d93a021efa77f/FLAGf5726e376 [2025-03-03 16:13:37,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:13:37,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:13:37,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15db7c03/2c8fd74edea341e1848d93a021efa77f/FLAGf5726e376 [2025-03-03 16:13:37,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d15db7c03/2c8fd74edea341e1848d93a021efa77f [2025-03-03 16:13:37,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:13:37,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:13:37,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:13:37,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:13:37,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:13:37,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:13:37" (1/1) ... [2025-03-03 16:13:37,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cdb26f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:37, skipping insertion in model container [2025-03-03 16:13:37,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:13:37" (1/1) ... [2025-03-03 16:13:37,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:13:37,609 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.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2025-03-03 16:13:37,664 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.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2025-03-03 16:13:38,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:13:38,094 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:13:38,133 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.6.ufo.UNBOUNDED.pals+Problem12_label05.c[15510,15523] [2025-03-03 16:13:38,142 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.6.ufo.UNBOUNDED.pals+Problem12_label05.c[22446,22459] [2025-03-03 16:13:38,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:13:38,410 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:13:38,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38 WrapperNode [2025-03-03 16:13:38,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:13:38,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:13:38,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:13:38,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:13:38,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,676 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5151 [2025-03-03 16:13:38,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:13:38,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:13:38,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:13:38,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:13:38,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,856 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-03 16:13:38,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:38,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:39,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:39,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:13:39,040 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:13:39,040 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:13:39,040 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:13:39,041 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (1/1) ... [2025-03-03 16:13:39,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:13:39,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:39,064 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-03 16:13:39,070 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-03 16:13:39,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:13:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:13:39,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:13:39,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:13:39,162 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:13:39,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:13:42,455 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3685: havoc calculate_output2_#t~ret42#1; [2025-03-03 16:13:42,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5175: havoc calculate_output3_#t~ret43#1; [2025-03-03 16:13:42,456 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2206: havoc calculate_output_#t~ret41#1; [2025-03-03 16:13:42,580 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-03 16:13:42,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:13:42,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:13:42,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:13:42,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:13:42 BoogieIcfgContainer [2025-03-03 16:13:42,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:13:42,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:13:42,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:13:42,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:13:42,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:13:37" (1/3) ... [2025-03-03 16:13:42,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d9799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:13:42, skipping insertion in model container [2025-03-03 16:13:42,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:13:38" (2/3) ... [2025-03-03 16:13:42,624 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d9799b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:13:42, skipping insertion in model container [2025-03-03 16:13:42,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:13:42" (3/3) ... [2025-03-03 16:13:42,625 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-03 16:13:42,638 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:13:42,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:13:42,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:13:42,717 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;@38946290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:13:42,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:13:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 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-03 16:13:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:13:42,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:42,729 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] [2025-03-03 16:13:42,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:42,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1738102833, now seen corresponding path program 1 times [2025-03-03 16:13:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:42,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048088219] [2025-03-03 16:13:42,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:42,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:13:42,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:13:42,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:42,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:42,932 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-03 16:13:42,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:42,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048088219] [2025-03-03 16:13:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048088219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:13:42,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369666581] [2025-03-03 16:13:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:42,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 16:13:42,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:42,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 16:13:42,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:13:42,960 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-03 16:13:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:43,031 INFO L93 Difference]: Finished difference Result 1783 states and 3381 transitions. [2025-03-03 16:13:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 16:13:43,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:13:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:43,049 INFO L225 Difference]: With dead ends: 1783 [2025-03-03 16:13:43,049 INFO L226 Difference]: Without dead ends: 850 [2025-03-03 16:13:43,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 16:13:43,058 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:43,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-03 16:13:43,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-03 16:13:43,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.892688679245283) internal successors, (1605), 849 states have internal predecessors, (1605), 0 states have call successors, (0), 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-03 16:13:43,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1605 transitions. [2025-03-03 16:13:43,118 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1605 transitions. Word has length 26 [2025-03-03 16:13:43,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:43,118 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1605 transitions. [2025-03-03 16:13:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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-03 16:13:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1605 transitions. [2025-03-03 16:13:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:13:43,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:43,121 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] [2025-03-03 16:13:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:13:43,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:43,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -2146927058, now seen corresponding path program 1 times [2025-03-03 16:13:43,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744814999] [2025-03-03 16:13:43,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:43,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:13:43,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:13:43,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:43,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:43,334 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-03 16:13:43,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744814999] [2025-03-03 16:13:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744814999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:43,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:13:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060110954] [2025-03-03 16:13:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:43,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:13:43,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:13:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:13:43,337 INFO L87 Difference]: Start difference. First operand 850 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-03 16:13:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:43,465 INFO L93 Difference]: Finished difference Result 904 states and 1689 transitions. [2025-03-03 16:13:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:13:43,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:13:43,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:43,471 INFO L225 Difference]: With dead ends: 904 [2025-03-03 16:13:43,471 INFO L226 Difference]: Without dead ends: 850 [2025-03-03 16:13:43,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:13:43,472 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:43,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-03 16:13:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-03-03 16:13:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.8455188679245282) internal successors, (1565), 849 states have internal predecessors, (1565), 0 states have call successors, (0), 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-03 16:13:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1565 transitions. [2025-03-03 16:13:43,496 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1565 transitions. Word has length 26 [2025-03-03 16:13:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:43,496 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1565 transitions. [2025-03-03 16:13:43,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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-03 16:13:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1565 transitions. [2025-03-03 16:13:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 16:13:43,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:43,497 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] [2025-03-03 16:13:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:13:43,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:43,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1614373110, now seen corresponding path program 1 times [2025-03-03 16:13:43,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:43,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380154489] [2025-03-03 16:13:43,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:43,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:43,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 16:13:43,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 16:13:43,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:43,698 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-03 16:13:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:43,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380154489] [2025-03-03 16:13:43,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380154489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:43,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:43,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:43,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022216408] [2025-03-03 16:13:43,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:43,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:13:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:43,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:13:43,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:13:43,701 INFO L87 Difference]: Start difference. First operand 850 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:48,378 INFO L93 Difference]: Finished difference Result 3105 states and 5874 transitions. [2025-03-03 16:13:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:13:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 16:13:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:48,387 INFO L225 Difference]: With dead ends: 3105 [2025-03-03 16:13:48,387 INFO L226 Difference]: Without dead ends: 2352 [2025-03-03 16:13:48,388 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-03 16:13:48,388 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 2433 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:48,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 837 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-03 16:13:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-03-03 16:13:48,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2025-03-03 16:13:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2350 states have (on average 1.5706382978723403) internal successors, (3691), 2351 states have internal predecessors, (3691), 0 states have call successors, (0), 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-03 16:13:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3691 transitions. [2025-03-03 16:13:48,427 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3691 transitions. Word has length 60 [2025-03-03 16:13:48,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:48,428 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3691 transitions. [2025-03-03 16:13:48,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:48,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3691 transitions. [2025-03-03 16:13:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:13:48,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:48,432 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] [2025-03-03 16:13:48,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:13:48,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:48,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1878112614, now seen corresponding path program 1 times [2025-03-03 16:13:48,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:48,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080269510] [2025-03-03 16:13:48,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:48,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:48,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:13:48,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:13:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:48,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:48,612 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-03 16:13:48,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:48,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080269510] [2025-03-03 16:13:48,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080269510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276983262] [2025-03-03 16:13:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:48,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:48,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:48,614 INFO L87 Difference]: Start difference. First operand 2352 states and 3691 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-03 16:13:48,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:48,830 INFO L93 Difference]: Finished difference Result 2952 states and 4651 transitions. [2025-03-03 16:13:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:13:48,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:13:48,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:48,840 INFO L225 Difference]: With dead ends: 2952 [2025-03-03 16:13:48,840 INFO L226 Difference]: Without dead ends: 2902 [2025-03-03 16:13:48,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:13:48,843 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:48,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:48,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-03-03 16:13:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2400. [2025-03-03 16:13:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2398 states have (on average 1.5713094245204338) internal successors, (3768), 2399 states have internal predecessors, (3768), 0 states have call successors, (0), 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-03 16:13:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3768 transitions. [2025-03-03 16:13:48,896 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3768 transitions. Word has length 65 [2025-03-03 16:13:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:48,897 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3768 transitions. [2025-03-03 16:13:48,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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-03 16:13:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3768 transitions. [2025-03-03 16:13:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:13:48,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:48,899 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] [2025-03-03 16:13:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:13:48,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:48,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:48,900 INFO L85 PathProgramCache]: Analyzing trace with hash 140395509, now seen corresponding path program 1 times [2025-03-03 16:13:48,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:48,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394028040] [2025-03-03 16:13:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:48,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:13:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:13:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:49,009 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-03 16:13:49,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394028040] [2025-03-03 16:13:49,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394028040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:49,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:49,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:49,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398993276] [2025-03-03 16:13:49,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:49,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:49,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:49,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:49,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:49,011 INFO L87 Difference]: Start difference. First operand 2400 states and 3768 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:49,045 INFO L93 Difference]: Finished difference Result 2585 states and 4063 transitions. [2025-03-03 16:13:49,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:49,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:13:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:49,054 INFO L225 Difference]: With dead ends: 2585 [2025-03-03 16:13:49,054 INFO L226 Difference]: Without dead ends: 2487 [2025-03-03 16:13:49,055 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-03 16:13:49,056 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 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-03 16:13:49,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-03-03 16:13:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2025-03-03 16:13:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5711406690850465) internal successors, (3898), 2482 states have internal predecessors, (3898), 0 states have call successors, (0), 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-03 16:13:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3898 transitions. [2025-03-03 16:13:49,097 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3898 transitions. Word has length 67 [2025-03-03 16:13:49,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:49,098 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3898 transitions. [2025-03-03 16:13:49,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3898 transitions. [2025-03-03 16:13:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:13:49,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:49,099 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] [2025-03-03 16:13:49,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:13:49,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:49,100 INFO L85 PathProgramCache]: Analyzing trace with hash 172718744, now seen corresponding path program 1 times [2025-03-03 16:13:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22816281] [2025-03-03 16:13:49,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:49,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:49,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:13:49,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:13:49,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:49,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:49,398 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-03 16:13:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22816281] [2025-03-03 16:13:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22816281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:49,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:49,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888040881] [2025-03-03 16:13:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:49,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:49,403 INFO L87 Difference]: Start difference. First operand 2483 states and 3898 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:49,610 INFO L93 Difference]: Finished difference Result 2666 states and 4186 transitions. [2025-03-03 16:13:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:49,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:13:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:49,617 INFO L225 Difference]: With dead ends: 2666 [2025-03-03 16:13:49,618 INFO L226 Difference]: Without dead ends: 2485 [2025-03-03 16:13:49,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:13:49,619 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 7515 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7515 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:49,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7515 Valid, 1941 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-03 16:13:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-03-03 16:13:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.570334542523176) internal successors, (3896), 2482 states have internal predecessors, (3896), 0 states have call successors, (0), 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-03 16:13:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3896 transitions. [2025-03-03 16:13:49,657 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3896 transitions. Word has length 67 [2025-03-03 16:13:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:49,657 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3896 transitions. [2025-03-03 16:13:49,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3896 transitions. [2025-03-03 16:13:49,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:13:49,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:49,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:49,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:13:49,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:49,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1089851502, now seen corresponding path program 1 times [2025-03-03 16:13:49,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:49,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860154101] [2025-03-03 16:13:49,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:49,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:49,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:13:49,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:13:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:49,874 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-03 16:13:49,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:49,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860154101] [2025-03-03 16:13:49,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860154101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:49,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:49,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144807042] [2025-03-03 16:13:49,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:49,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:49,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:49,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:49,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:49,875 INFO L87 Difference]: Start difference. First operand 2483 states and 3896 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:49,922 INFO L93 Difference]: Finished difference Result 2491 states and 3905 transitions. [2025-03-03 16:13:49,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 16:13:49,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:49,930 INFO L225 Difference]: With dead ends: 2491 [2025-03-03 16:13:49,930 INFO L226 Difference]: Without dead ends: 2489 [2025-03-03 16:13:49,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:49,932 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 0 mSDsluCounter, 9341 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10900 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:49,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10900 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-03 16:13:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-03-03 16:13:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.5685564937675915) internal successors, (3901), 2488 states have internal predecessors, (3901), 0 states have call successors, (0), 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-03 16:13:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3901 transitions. [2025-03-03 16:13:49,970 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3901 transitions. Word has length 68 [2025-03-03 16:13:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:49,970 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3901 transitions. [2025-03-03 16:13:49,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:49,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3901 transitions. [2025-03-03 16:13:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:13:49,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:49,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:13:49,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:13:49,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1188896010, now seen corresponding path program 1 times [2025-03-03 16:13:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:49,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309771808] [2025-03-03 16:13:49,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:49,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:49,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:13:49,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:13:49,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:49,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,019 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-03 16:13:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309771808] [2025-03-03 16:13:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309771808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111244170] [2025-03-03 16:13:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,021 INFO L87 Difference]: Start difference. First operand 2489 states and 3901 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,042 INFO L93 Difference]: Finished difference Result 2847 states and 4453 transitions. [2025-03-03 16:13:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:13:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,050 INFO L225 Difference]: With dead ends: 2847 [2025-03-03 16:13:50,050 INFO L226 Difference]: Without dead ends: 2660 [2025-03-03 16:13:50,051 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-03 16:13:50,051 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 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-03 16:13:50,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-03 16:13:50,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-03-03 16:13:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2656 states have (on average 1.5655120481927711) internal successors, (4158), 2657 states have internal predecessors, (4158), 0 states have call successors, (0), 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-03 16:13:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4158 transitions. [2025-03-03 16:13:50,091 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4158 transitions. Word has length 69 [2025-03-03 16:13:50,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:50,091 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4158 transitions. [2025-03-03 16:13:50,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4158 transitions. [2025-03-03 16:13:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:13:50,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:50,092 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] [2025-03-03 16:13:50,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:13:50,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:50,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:50,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2127140790, now seen corresponding path program 1 times [2025-03-03 16:13:50,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:50,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060208140] [2025-03-03 16:13:50,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:50,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:50,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:13:50,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:13:50,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:50,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,136 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-03 16:13:50,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060208140] [2025-03-03 16:13:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060208140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175671143] [2025-03-03 16:13:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,138 INFO L87 Difference]: Start difference. First operand 2658 states and 4158 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,162 INFO L93 Difference]: Finished difference Result 3338 states and 5196 transitions. [2025-03-03 16:13:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:13:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,170 INFO L225 Difference]: With dead ends: 3338 [2025-03-03 16:13:50,171 INFO L226 Difference]: Without dead ends: 2982 [2025-03-03 16:13:50,172 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-03 16:13:50,172 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 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-03 16:13:50,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-03-03 16:13:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2980. [2025-03-03 16:13:50,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5580926796507724) internal successors, (4640), 2979 states have internal predecessors, (4640), 0 states have call successors, (0), 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-03 16:13:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4640 transitions. [2025-03-03 16:13:50,215 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4640 transitions. Word has length 69 [2025-03-03 16:13:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4640 transitions. [2025-03-03 16:13:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4640 transitions. [2025-03-03 16:13:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:13:50,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:50,216 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] [2025-03-03 16:13:50,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:13:50,216 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:50,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1679195254, now seen corresponding path program 1 times [2025-03-03 16:13:50,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:50,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106508963] [2025-03-03 16:13:50,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:50,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:50,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:13:50,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:13:50,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:50,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,258 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-03 16:13:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106508963] [2025-03-03 16:13:50,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106508963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669983677] [2025-03-03 16:13:50,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,260 INFO L87 Difference]: Start difference. First operand 2980 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,288 INFO L93 Difference]: Finished difference Result 4272 states and 6586 transitions. [2025-03-03 16:13:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:13:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,298 INFO L225 Difference]: With dead ends: 4272 [2025-03-03 16:13:50,298 INFO L226 Difference]: Without dead ends: 3594 [2025-03-03 16:13:50,300 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-03 16:13:50,300 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 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-03 16:13:50,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-03-03 16:13:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2025-03-03 16:13:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3590 states have (on average 1.543175487465181) internal successors, (5540), 3591 states have internal predecessors, (5540), 0 states have call successors, (0), 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-03 16:13:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5540 transitions. [2025-03-03 16:13:50,357 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5540 transitions. Word has length 69 [2025-03-03 16:13:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 5540 transitions. [2025-03-03 16:13:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5540 transitions. [2025-03-03 16:13:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:13:50,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:50,358 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] [2025-03-03 16:13:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:13:50,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2094371126, now seen corresponding path program 1 times [2025-03-03 16:13:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557567003] [2025-03-03 16:13:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:50,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:13:50,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:13:50,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:50,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,398 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-03 16:13:50,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557567003] [2025-03-03 16:13:50,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557567003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095177382] [2025-03-03 16:13:50,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,400 INFO L87 Difference]: Start difference. First operand 3592 states and 5540 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,468 INFO L93 Difference]: Finished difference Result 6044 states and 9174 transitions. [2025-03-03 16:13:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:13:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,476 INFO L225 Difference]: With dead ends: 6044 [2025-03-03 16:13:50,476 INFO L226 Difference]: Without dead ends: 4754 [2025-03-03 16:13:50,477 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-03 16:13:50,477 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 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-03 16:13:50,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-03-03 16:13:50,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4752. [2025-03-03 16:13:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4750 states have (on average 1.5183157894736843) internal successors, (7212), 4751 states have internal predecessors, (7212), 0 states have call successors, (0), 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-03 16:13:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7212 transitions. [2025-03-03 16:13:50,559 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7212 transitions. Word has length 69 [2025-03-03 16:13:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:50,559 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7212 transitions. [2025-03-03 16:13:50,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7212 transitions. [2025-03-03 16:13:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:13:50,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:50,561 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] [2025-03-03 16:13:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:13:50,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:50,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:50,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1607652854, now seen corresponding path program 1 times [2025-03-03 16:13:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:50,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655151908] [2025-03-03 16:13:50,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:50,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:50,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:13:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:13:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,600 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-03 16:13:50,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655151908] [2025-03-03 16:13:50,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655151908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695309254] [2025-03-03 16:13:50,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,602 INFO L87 Difference]: Start difference. First operand 4752 states and 7212 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,667 INFO L93 Difference]: Finished difference Result 9396 states and 13966 transitions. [2025-03-03 16:13:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 16:13:50,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,678 INFO L225 Difference]: With dead ends: 9396 [2025-03-03 16:13:50,679 INFO L226 Difference]: Without dead ends: 6946 [2025-03-03 16:13:50,683 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-03 16:13:50,684 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 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-03 16:13:50,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-03-03 16:13:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6944. [2025-03-03 16:13:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6942 states have (on average 1.4837222702391242) internal successors, (10300), 6943 states have internal predecessors, (10300), 0 states have call successors, (0), 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-03 16:13:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10300 transitions. [2025-03-03 16:13:50,813 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10300 transitions. Word has length 69 [2025-03-03 16:13:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:50,813 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10300 transitions. [2025-03-03 16:13:50,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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-03 16:13:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10300 transitions. [2025-03-03 16:13:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 16:13:50,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:50,814 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] [2025-03-03 16:13:50,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:13:50,814 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:50,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1834425366, now seen corresponding path program 1 times [2025-03-03 16:13:50,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:50,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326396368] [2025-03-03 16:13:50,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:50,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 16:13:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 16:13:50,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:50,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:50,854 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-03 16:13:50,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:50,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326396368] [2025-03-03 16:13:50,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326396368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:50,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:50,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029943538] [2025-03-03 16:13:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:50,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:50,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:50,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:50,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:50,855 INFO L87 Difference]: Start difference. First operand 6944 states and 10300 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-03 16:13:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:50,937 INFO L93 Difference]: Finished difference Result 11815 states and 17410 transitions. [2025-03-03 16:13:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-03 16:13:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:50,952 INFO L225 Difference]: With dead ends: 11815 [2025-03-03 16:13:50,952 INFO L226 Difference]: Without dead ends: 9188 [2025-03-03 16:13:50,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-03 16:13:50,957 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 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-03 16:13:50,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2025-03-03 16:13:51,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9186. [2025-03-03 16:13:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9184 states have (on average 1.4666811846689896) internal successors, (13470), 9185 states have internal predecessors, (13470), 0 states have call successors, (0), 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-03 16:13:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 13470 transitions. [2025-03-03 16:13:51,187 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 13470 transitions. Word has length 71 [2025-03-03 16:13:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:51,187 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 13470 transitions. [2025-03-03 16:13:51,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-03 16:13:51,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 13470 transitions. [2025-03-03 16:13:51,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:51,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:51,190 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:51,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:13:51,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:51,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:51,190 INFO L85 PathProgramCache]: Analyzing trace with hash -65687301, now seen corresponding path program 1 times [2025-03-03 16:13:51,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:51,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075463650] [2025-03-03 16:13:51,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:51,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:51,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:51,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:51,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:51,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:13:51,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075463650] [2025-03-03 16:13:51,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075463650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:51,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:51,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:51,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787423125] [2025-03-03 16:13:51,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:51,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:51,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:51,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:51,332 INFO L87 Difference]: Start difference. First operand 9186 states and 13470 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-03 16:13:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:52,005 INFO L93 Difference]: Finished difference Result 51920 states and 74597 transitions. [2025-03-03 16:13:52,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:52,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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 90 [2025-03-03 16:13:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:52,091 INFO L225 Difference]: With dead ends: 51920 [2025-03-03 16:13:52,091 INFO L226 Difference]: Without dead ends: 45038 [2025-03-03 16:13:52,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:52,109 INFO L435 NwaCegarLoop]: 1645 mSDtfsCounter, 8052 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8052 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:52,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8052 Valid, 4044 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45038 states. [2025-03-03 16:13:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45038 to 16066. [2025-03-03 16:13:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16066 states, 16064 states have (on average 1.4460906374501992) internal successors, (23230), 16065 states have internal predecessors, (23230), 0 states have call successors, (0), 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-03 16:13:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16066 states to 16066 states and 23230 transitions. [2025-03-03 16:13:52,628 INFO L78 Accepts]: Start accepts. Automaton has 16066 states and 23230 transitions. Word has length 90 [2025-03-03 16:13:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:52,629 INFO L471 AbstractCegarLoop]: Abstraction has 16066 states and 23230 transitions. [2025-03-03 16:13:52,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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-03 16:13:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 16066 states and 23230 transitions. [2025-03-03 16:13:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:52,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:52,632 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:52,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:13:52,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:52,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1044617797, now seen corresponding path program 1 times [2025-03-03 16:13:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:52,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743862902] [2025-03-03 16:13:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:52,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:52,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:52,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:52,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:13:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:52,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743862902] [2025-03-03 16:13:52,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743862902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:52,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:52,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:52,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976867300] [2025-03-03 16:13:52,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:52,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:52,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:52,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:52,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:52,814 INFO L87 Difference]: Start difference. First operand 16066 states and 23230 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 16:13:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:53,503 INFO L93 Difference]: Finished difference Result 58800 states and 84357 transitions. [2025-03-03 16:13:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 16:13:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:53,587 INFO L225 Difference]: With dead ends: 58800 [2025-03-03 16:13:53,588 INFO L226 Difference]: Without dead ends: 51918 [2025-03-03 16:13:53,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:53,603 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8073 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8073 SdHoareTripleChecker+Valid, 3964 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:53,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8073 Valid, 3964 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51918 states. [2025-03-03 16:13:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51918 to 26402. [2025-03-03 16:13:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26402 states, 26400 states have (on average 1.431439393939394) internal successors, (37790), 26401 states have internal predecessors, (37790), 0 states have call successors, (0), 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-03 16:13:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 37790 transitions. [2025-03-03 16:13:54,282 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 37790 transitions. Word has length 90 [2025-03-03 16:13:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:54,282 INFO L471 AbstractCegarLoop]: Abstraction has 26402 states and 37790 transitions. [2025-03-03 16:13:54,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 16:13:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 37790 transitions. [2025-03-03 16:13:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:54,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:54,285 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:54,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:13:54,285 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1492563333, now seen corresponding path program 1 times [2025-03-03 16:13:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912987307] [2025-03-03 16:13:54,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:54,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:54,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:54,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:54,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:54,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:13:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912987307] [2025-03-03 16:13:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912987307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:54,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778243141] [2025-03-03 16:13:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:54,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:54,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:54,413 INFO L87 Difference]: Start difference. First operand 26402 states and 37790 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-03 16:13:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:55,486 INFO L93 Difference]: Finished difference Result 65680 states and 94117 transitions. [2025-03-03 16:13:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-03 16:13:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:55,568 INFO L225 Difference]: With dead ends: 65680 [2025-03-03 16:13:55,568 INFO L226 Difference]: Without dead ends: 58798 [2025-03-03 16:13:55,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:55,586 INFO L435 NwaCegarLoop]: 1639 mSDtfsCounter, 8114 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8114 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:55,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8114 Valid, 3916 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58798 states. [2025-03-03 16:13:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58798 to 33282. [2025-03-03 16:13:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33282 states, 33280 states have (on average 1.4287860576923077) internal successors, (47550), 33281 states have internal predecessors, (47550), 0 states have call successors, (0), 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-03 16:13:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33282 states to 33282 states and 47550 transitions. [2025-03-03 16:13:56,742 INFO L78 Accepts]: Start accepts. Automaton has 33282 states and 47550 transitions. Word has length 90 [2025-03-03 16:13:56,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:56,742 INFO L471 AbstractCegarLoop]: Abstraction has 33282 states and 47550 transitions. [2025-03-03 16:13:56,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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-03 16:13:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33282 states and 47550 transitions. [2025-03-03 16:13:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:56,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:56,745 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:13:56,745 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1077387461, now seen corresponding path program 1 times [2025-03-03 16:13:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291551127] [2025-03-03 16:13:56,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:56,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:56,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:56,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:56,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:56,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:13:56,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:56,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291551127] [2025-03-03 16:13:56,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291551127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:56,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713843177] [2025-03-03 16:13:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:56,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:56,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:56,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:56,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:56,881 INFO L87 Difference]: Start difference. First operand 33282 states and 47550 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-03 16:13:57,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:57,857 INFO L93 Difference]: Finished difference Result 72560 states and 103877 transitions. [2025-03-03 16:13:57,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:57,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-03 16:13:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:57,931 INFO L225 Difference]: With dead ends: 72560 [2025-03-03 16:13:57,931 INFO L226 Difference]: Without dead ends: 65678 [2025-03-03 16:13:57,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:57,940 INFO L435 NwaCegarLoop]: 1636 mSDtfsCounter, 8164 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8164 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:57,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8164 Valid, 3917 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2025-03-03 16:13:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 40162. [2025-03-03 16:13:58,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40162 states, 40160 states have (on average 1.4270418326693226) internal successors, (57310), 40161 states have internal predecessors, (57310), 0 states have call successors, (0), 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-03 16:13:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 57310 transitions. [2025-03-03 16:13:58,771 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 57310 transitions. Word has length 90 [2025-03-03 16:13:58,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:58,771 INFO L471 AbstractCegarLoop]: Abstraction has 40162 states and 57310 transitions. [2025-03-03 16:13:58,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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-03 16:13:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 57310 transitions. [2025-03-03 16:13:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:58,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:58,774 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:13:58,774 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:58,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1564105733, now seen corresponding path program 1 times [2025-03-03 16:13:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358871693] [2025-03-03 16:13:58,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:58,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:58,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:58,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:58,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:13:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358871693] [2025-03-03 16:13:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358871693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845646759] [2025-03-03 16:13:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:58,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:58,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:58,891 INFO L87 Difference]: Start difference. First operand 40162 states and 57310 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 16:13:59,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:59,916 INFO L93 Difference]: Finished difference Result 79440 states and 113637 transitions. [2025-03-03 16:13:59,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:59,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 90 [2025-03-03 16:13:59,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:59,997 INFO L225 Difference]: With dead ends: 79440 [2025-03-03 16:13:59,997 INFO L226 Difference]: Without dead ends: 72558 [2025-03-03 16:14:00,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:00,027 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8068 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8068 SdHoareTripleChecker+Valid, 4011 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:00,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8068 Valid, 4011 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-03-03 16:14:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 47042. [2025-03-03 16:14:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47042 states, 47040 states have (on average 1.4258078231292517) internal successors, (67070), 47041 states have internal predecessors, (67070), 0 states have call successors, (0), 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-03 16:14:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47042 states to 47042 states and 67070 transitions. [2025-03-03 16:14:01,572 INFO L78 Accepts]: Start accepts. Automaton has 47042 states and 67070 transitions. Word has length 90 [2025-03-03 16:14:01,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:01,572 INFO L471 AbstractCegarLoop]: Abstraction has 47042 states and 67070 transitions. [2025-03-03 16:14:01,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 16:14:01,572 INFO L276 IsEmpty]: Start isEmpty. Operand 47042 states and 67070 transitions. [2025-03-03 16:14:01,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:14:01,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:01,577 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:14:01,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:14:01,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1843277639, now seen corresponding path program 1 times [2025-03-03 16:14:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:01,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937082277] [2025-03-03 16:14:01,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:01,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:14:01,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:14:01,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:01,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:01,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:01,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937082277] [2025-03-03 16:14:01,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937082277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:01,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:01,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:01,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198417900] [2025-03-03 16:14:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:01,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:01,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:01,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:01,668 INFO L87 Difference]: Start difference. First operand 47042 states and 67070 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:14:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:02,411 INFO L93 Difference]: Finished difference Result 78684 states and 112439 transitions. [2025-03-03 16:14:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:02,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 16:14:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:02,450 INFO L225 Difference]: With dead ends: 78684 [2025-03-03 16:14:02,450 INFO L226 Difference]: Without dead ends: 33946 [2025-03-03 16:14:02,474 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-03 16:14:02,475 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:02,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2025-03-03 16:14:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33944. [2025-03-03 16:14:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33944 states, 33942 states have (on average 1.4307937069117906) internal successors, (48564), 33943 states have internal predecessors, (48564), 0 states have call successors, (0), 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-03 16:14:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33944 states to 33944 states and 48564 transitions. [2025-03-03 16:14:03,071 INFO L78 Accepts]: Start accepts. Automaton has 33944 states and 48564 transitions. Word has length 92 [2025-03-03 16:14:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:03,071 INFO L471 AbstractCegarLoop]: Abstraction has 33944 states and 48564 transitions. [2025-03-03 16:14:03,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:14:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 33944 states and 48564 transitions. [2025-03-03 16:14:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:14:03,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:03,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:03,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:14:03,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:03,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1093763877, now seen corresponding path program 1 times [2025-03-03 16:14:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108082160] [2025-03-03 16:14:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:03,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:14:03,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:14:03,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:03,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:14:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:03,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108082160] [2025-03-03 16:14:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108082160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:14:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567209161] [2025-03-03 16:14:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:03,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:14:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:03,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:14:03,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:14:03,183 INFO L87 Difference]: Start difference. First operand 33944 states and 48564 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-03 16:14:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:04,111 INFO L93 Difference]: Finished difference Result 63142 states and 90427 transitions. [2025-03-03 16:14:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:14:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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 92 [2025-03-03 16:14:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:04,177 INFO L225 Difference]: With dead ends: 63142 [2025-03-03 16:14:04,177 INFO L226 Difference]: Without dead ends: 58276 [2025-03-03 16:14:04,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:14:04,196 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:04,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:14:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58276 states. [2025-03-03 16:14:05,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58276 to 38808. [2025-03-03 16:14:05,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38808 states, 38806 states have (on average 1.4295727464825028) internal successors, (55476), 38807 states have internal predecessors, (55476), 0 states have call successors, (0), 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-03 16:14:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38808 states to 38808 states and 55476 transitions. [2025-03-03 16:14:05,260 INFO L78 Accepts]: Start accepts. Automaton has 38808 states and 55476 transitions. Word has length 92 [2025-03-03 16:14:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:05,260 INFO L471 AbstractCegarLoop]: Abstraction has 38808 states and 55476 transitions. [2025-03-03 16:14:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 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-03 16:14:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38808 states and 55476 transitions. [2025-03-03 16:14:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:14:05,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:05,263 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:14:05,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:14:05,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:05,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash 543737427, now seen corresponding path program 1 times [2025-03-03 16:14:05,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:05,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107212930] [2025-03-03 16:14:05,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:05,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:05,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:14:05,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:14:05,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:05,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:05,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:05,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107212930] [2025-03-03 16:14:05,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107212930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:05,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:05,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550900708] [2025-03-03 16:14:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:05,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:05,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:05,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:05,328 INFO L87 Difference]: Start difference. First operand 38808 states and 55476 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-03 16:14:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:05,638 INFO L93 Difference]: Finished difference Result 57052 states and 81398 transitions. [2025-03-03 16:14:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:05,638 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-03 16:14:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:05,662 INFO L225 Difference]: With dead ends: 57052 [2025-03-03 16:14:05,662 INFO L226 Difference]: Without dead ends: 20570 [2025-03-03 16:14:05,685 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-03 16:14:05,686 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:05,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2025-03-03 16:14:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20568. [2025-03-03 16:14:06,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20568 states, 20566 states have (on average 1.4254594962559564) internal successors, (29316), 20567 states have internal predecessors, (29316), 0 states have call successors, (0), 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-03 16:14:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20568 states to 20568 states and 29316 transitions. [2025-03-03 16:14:06,058 INFO L78 Accepts]: Start accepts. Automaton has 20568 states and 29316 transitions. Word has length 93 [2025-03-03 16:14:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:06,058 INFO L471 AbstractCegarLoop]: Abstraction has 20568 states and 29316 transitions. [2025-03-03 16:14:06,058 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-03 16:14:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20568 states and 29316 transitions. [2025-03-03 16:14:06,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:14:06,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:06,060 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:14:06,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:14:06,060 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:06,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1280111130, now seen corresponding path program 1 times [2025-03-03 16:14:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:06,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817172007] [2025-03-03 16:14:06,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:06,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:14:06,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:14:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817172007] [2025-03-03 16:14:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817172007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:06,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044312941] [2025-03-03 16:14:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:06,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:06,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:06,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:06,161 INFO L87 Difference]: Start difference. First operand 20568 states and 29316 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-03 16:14:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:06,418 INFO L93 Difference]: Finished difference Result 29692 states and 42158 transitions. [2025-03-03 16:14:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:06,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 16:14:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:06,432 INFO L225 Difference]: With dead ends: 29692 [2025-03-03 16:14:06,432 INFO L226 Difference]: Without dead ends: 11450 [2025-03-03 16:14:06,444 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-03 16:14:06,445 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:06,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:06,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-03-03 16:14:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11448. [2025-03-03 16:14:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11448 states, 11446 states have (on average 1.4289708195002622) internal successors, (16356), 11447 states have internal predecessors, (16356), 0 states have call successors, (0), 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-03 16:14:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 16356 transitions. [2025-03-03 16:14:06,762 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 16356 transitions. Word has length 95 [2025-03-03 16:14:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:06,762 INFO L471 AbstractCegarLoop]: Abstraction has 11448 states and 16356 transitions. [2025-03-03 16:14:06,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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-03 16:14:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 16356 transitions. [2025-03-03 16:14:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:14:06,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:06,764 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:14:06,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:14:06,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:06,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 2035285761, now seen corresponding path program 1 times [2025-03-03 16:14:06,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:06,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907053301] [2025-03-03 16:14:06,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:06,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:06,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:14:06,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:14:06,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:06,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907053301] [2025-03-03 16:14:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907053301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551445315] [2025-03-03 16:14:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:06,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:06,850 INFO L87 Difference]: Start difference. First operand 11448 states and 16356 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03 16:14:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:06,991 INFO L93 Difference]: Finished difference Result 16012 states and 22718 transitions. [2025-03-03 16:14:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:06,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 16:14:06,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:07,001 INFO L225 Difference]: With dead ends: 16012 [2025-03-03 16:14:07,001 INFO L226 Difference]: Without dead ends: 6890 [2025-03-03 16:14:07,007 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-03 16:14:07,008 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:07,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2025-03-03 16:14:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6888. [2025-03-03 16:14:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.4429276793494046) internal successors, (9936), 6887 states have internal predecessors, (9936), 0 states have call successors, (0), 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-03 16:14:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9936 transitions. [2025-03-03 16:14:07,185 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9936 transitions. Word has length 97 [2025-03-03 16:14:07,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:07,185 INFO L471 AbstractCegarLoop]: Abstraction has 6888 states and 9936 transitions. [2025-03-03 16:14:07,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03 16:14:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9936 transitions. [2025-03-03 16:14:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:14:07,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:07,187 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 16:14:07,187 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:07,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:07,187 INFO L85 PathProgramCache]: Analyzing trace with hash 238968072, now seen corresponding path program 1 times [2025-03-03 16:14:07,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:07,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865656591] [2025-03-03 16:14:07,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:07,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:14:07,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:14:07,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:07,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:07,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:07,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865656591] [2025-03-03 16:14:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865656591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:07,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:07,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108942150] [2025-03-03 16:14:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:07,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:07,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:07,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:07,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:07,266 INFO L87 Difference]: Start difference. First operand 6888 states and 9936 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-03 16:14:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:07,350 INFO L93 Difference]: Finished difference Result 9172 states and 13088 transitions. [2025-03-03 16:14:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 16:14:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:07,357 INFO L225 Difference]: With dead ends: 9172 [2025-03-03 16:14:07,357 INFO L226 Difference]: Without dead ends: 4610 [2025-03-03 16:14:07,360 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-03 16:14:07,360 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:07,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-03 16:14:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4608. [2025-03-03 16:14:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.4667824576639166) internal successors, (6756), 4607 states have internal predecessors, (6756), 0 states have call successors, (0), 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-03 16:14:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 6756 transitions. [2025-03-03 16:14:07,467 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 6756 transitions. Word has length 99 [2025-03-03 16:14:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:07,467 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 6756 transitions. [2025-03-03 16:14:07,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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-03 16:14:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 6756 transitions. [2025-03-03 16:14:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:14:07,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:07,469 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:07,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:14:07,469 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1556710353, now seen corresponding path program 1 times [2025-03-03 16:14:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363035392] [2025-03-03 16:14:07,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:07,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:14:07,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:14:07,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:07,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363035392] [2025-03-03 16:14:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363035392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:14:07,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:14:07,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:14:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863488485] [2025-03-03 16:14:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:14:07,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:14:07,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:07,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:14:07,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:14:07,557 INFO L87 Difference]: Start difference. First operand 4608 states and 6756 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 16:14:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:07,609 INFO L93 Difference]: Finished difference Result 5752 states and 8318 transitions. [2025-03-03 16:14:07,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:14:07,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-03 16:14:07,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:07,615 INFO L225 Difference]: With dead ends: 5752 [2025-03-03 16:14:07,615 INFO L226 Difference]: Without dead ends: 3470 [2025-03-03 16:14:07,616 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-03 16:14:07,617 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:07,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:14:07,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-03 16:14:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3468. [2025-03-03 16:14:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3466 states have (on average 1.494806693594922) internal successors, (5181), 3467 states have internal predecessors, (5181), 0 states have call successors, (0), 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-03 16:14:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5181 transitions. [2025-03-03 16:14:07,682 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5181 transitions. Word has length 101 [2025-03-03 16:14:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:07,683 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 5181 transitions. [2025-03-03 16:14:07,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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-03 16:14:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5181 transitions. [2025-03-03 16:14:07,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 16:14:07,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:07,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:07,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:14:07,684 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -928461706, now seen corresponding path program 1 times [2025-03-03 16:14:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491133177] [2025-03-03 16:14:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:07,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:14:07,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:14:07,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:07,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491133177] [2025-03-03 16:14:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491133177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705619505] [2025-03-03 16:14:08,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:08,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:14:08,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:14:08,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:14:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:14:08,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:08,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:14:08,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:08,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705619505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:09,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:14:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829064732] [2025-03-03 16:14:09,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:09,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:14:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:14:09,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:14:09,344 INFO L87 Difference]: Start difference. First operand 3468 states and 5181 transitions. Second operand has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 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-03 16:14:13,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:13,859 INFO L93 Difference]: Finished difference Result 13378 states and 18295 transitions. [2025-03-03 16:14:13,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-03 16:14:13,860 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 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 103 [2025-03-03 16:14:13,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:13,872 INFO L225 Difference]: With dead ends: 13378 [2025-03-03 16:14:13,872 INFO L226 Difference]: Without dead ends: 12138 [2025-03-03 16:14:13,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4035 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1793, Invalid=9549, Unknown=0, NotChecked=0, Total=11342 [2025-03-03 16:14:13,877 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 23440 mSDsluCounter, 8490 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23440 SdHoareTripleChecker+Valid, 10057 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:13,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23440 Valid, 10057 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2490 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 16:14:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12138 states. [2025-03-03 16:14:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12138 to 11292. [2025-03-03 16:14:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11292 states, 11290 states have (on average 1.362533215234721) internal successors, (15383), 11291 states have internal predecessors, (15383), 0 states have call successors, (0), 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-03 16:14:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11292 states to 11292 states and 15383 transitions. [2025-03-03 16:14:14,113 INFO L78 Accepts]: Start accepts. Automaton has 11292 states and 15383 transitions. Word has length 103 [2025-03-03 16:14:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:14,113 INFO L471 AbstractCegarLoop]: Abstraction has 11292 states and 15383 transitions. [2025-03-03 16:14:14,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.454545454545455) internal successors, (296), 22 states have internal predecessors, (296), 0 states have call successors, (0), 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-03 16:14:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 11292 states and 15383 transitions. [2025-03-03 16:14:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 16:14:14,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:14,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:14,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:14:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 16:14:14,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:14,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1152799269, now seen corresponding path program 1 times [2025-03-03 16:14:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262576060] [2025-03-03 16:14:14,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:14,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:14,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:14,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:14,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:14,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262576060] [2025-03-03 16:14:14,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262576060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:14,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776211569] [2025-03-03 16:14:14,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:14,542 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:14:14,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:14:14,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 16:14:14,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 16:14:14,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:14,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:14,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 16:14:14,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:15,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:15,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776211569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:15,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:15,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-03 16:14:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784349677] [2025-03-03 16:14:15,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:15,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 16:14:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:15,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 16:14:15,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:14:15,970 INFO L87 Difference]: Start difference. First operand 11292 states and 15383 transitions. Second operand has 32 states, 32 states have (on average 8.75) internal successors, (280), 32 states have internal predecessors, (280), 0 states have call successors, (0), 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-03 16:14:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:19,802 INFO L93 Difference]: Finished difference Result 67888 states and 89110 transitions. [2025-03-03 16:14:19,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-03 16:14:19,803 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.75) internal successors, (280), 32 states have internal predecessors, (280), 0 states have call successors, (0), 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 104 [2025-03-03 16:14:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:19,861 INFO L225 Difference]: With dead ends: 67888 [2025-03-03 16:14:19,861 INFO L226 Difference]: Without dead ends: 59036 [2025-03-03 16:14:19,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2268 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1374, Invalid=6998, Unknown=0, NotChecked=0, Total=8372 [2025-03-03 16:14:19,874 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 12960 mSDsluCounter, 17526 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12960 SdHoareTripleChecker+Valid, 19048 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:19,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12960 Valid, 19048 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:14:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59036 states. [2025-03-03 16:14:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59036 to 37004. [2025-03-03 16:14:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37004 states, 37002 states have (on average 1.2947137992540945) internal successors, (47907), 37003 states have internal predecessors, (47907), 0 states have call successors, (0), 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-03 16:14:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37004 states to 37004 states and 47907 transitions. [2025-03-03 16:14:21,088 INFO L78 Accepts]: Start accepts. Automaton has 37004 states and 47907 transitions. Word has length 104 [2025-03-03 16:14:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:21,089 INFO L471 AbstractCegarLoop]: Abstraction has 37004 states and 47907 transitions. [2025-03-03 16:14:21,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.75) internal successors, (280), 32 states have internal predecessors, (280), 0 states have call successors, (0), 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-03 16:14:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 37004 states and 47907 transitions. [2025-03-03 16:14:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 16:14:21,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:21,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:21,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:14:21,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 16:14:21,291 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:21,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash 835425124, now seen corresponding path program 1 times [2025-03-03 16:14:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:21,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437396395] [2025-03-03 16:14:21,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:21,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:14:21,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:14:21,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:21,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437396395] [2025-03-03 16:14:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437396395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423750535] [2025-03-03 16:14:21,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:21,503 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:14:21,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:14:21,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 16:14:21,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 16:14:21,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:21,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:21,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:14:21,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:21,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423750535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:22,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 16:14:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317071878] [2025-03-03 16:14:22,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:22,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 16:14:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 16:14:22,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 16:14:22,722 INFO L87 Difference]: Start difference. First operand 37004 states and 47907 transitions. Second operand has 25 states, 25 states have (on average 11.48) internal successors, (287), 24 states have internal predecessors, (287), 0 states have call successors, (0), 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-03 16:14:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:26,274 INFO L93 Difference]: Finished difference Result 109614 states and 141016 transitions. [2025-03-03 16:14:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 16:14:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.48) internal successors, (287), 24 states have internal predecessors, (287), 0 states have call successors, (0), 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 105 [2025-03-03 16:14:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:26,359 INFO L225 Difference]: With dead ends: 109614 [2025-03-03 16:14:26,359 INFO L226 Difference]: Without dead ends: 75096 [2025-03-03 16:14:26,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=632, Invalid=2448, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 16:14:26,386 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 18743 mSDsluCounter, 6860 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18743 SdHoareTripleChecker+Valid, 8399 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:26,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18743 Valid, 8399 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:14:26,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75096 states. [2025-03-03 16:14:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75096 to 69494. [2025-03-03 16:14:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69494 states, 69492 states have (on average 1.272347896160709) internal successors, (88418), 69493 states have internal predecessors, (88418), 0 states have call successors, (0), 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-03 16:14:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69494 states to 69494 states and 88418 transitions. [2025-03-03 16:14:28,629 INFO L78 Accepts]: Start accepts. Automaton has 69494 states and 88418 transitions. Word has length 105 [2025-03-03 16:14:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:28,630 INFO L471 AbstractCegarLoop]: Abstraction has 69494 states and 88418 transitions. [2025-03-03 16:14:28,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.48) internal successors, (287), 24 states have internal predecessors, (287), 0 states have call successors, (0), 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-03 16:14:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 69494 states and 88418 transitions. [2025-03-03 16:14:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 16:14:28,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:28,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:28,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 16:14:28,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:28,833 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:28,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1948722624, now seen corresponding path program 1 times [2025-03-03 16:14:28,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872403353] [2025-03-03 16:14:28,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:28,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:14:28,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:14:28,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:28,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872403353] [2025-03-03 16:14:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872403353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849547957] [2025-03-03 16:14:29,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:29,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:14:29,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:14:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 16:14:29,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 16:14:29,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:29,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:29,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:14:29,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:29,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849547957] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:30,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:30,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:14:30,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337897942] [2025-03-03 16:14:30,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:30,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:14:30,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:30,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:14:30,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:14:30,671 INFO L87 Difference]: Start difference. First operand 69494 states and 88418 transitions. Second operand has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 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-03 16:14:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:14:39,443 INFO L93 Difference]: Finished difference Result 351430 states and 444342 transitions. [2025-03-03 16:14:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 16:14:39,444 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 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 106 [2025-03-03 16:14:39,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:14:39,759 INFO L225 Difference]: With dead ends: 351430 [2025-03-03 16:14:39,759 INFO L226 Difference]: Without dead ends: 286222 [2025-03-03 16:14:39,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=627, Invalid=2453, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 16:14:39,814 INFO L435 NwaCegarLoop]: 1552 mSDtfsCounter, 17745 mSDsluCounter, 5389 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17745 SdHoareTripleChecker+Valid, 6941 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:14:39,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17745 Valid, 6941 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:14:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286222 states. [2025-03-03 16:14:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286222 to 284658. [2025-03-03 16:14:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284658 states, 284656 states have (on average 1.256460429430611) internal successors, (357659), 284657 states have internal predecessors, (357659), 0 states have call successors, (0), 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-03 16:14:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284658 states to 284658 states and 357659 transitions. [2025-03-03 16:14:50,607 INFO L78 Accepts]: Start accepts. Automaton has 284658 states and 357659 transitions. Word has length 106 [2025-03-03 16:14:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:14:50,607 INFO L471 AbstractCegarLoop]: Abstraction has 284658 states and 357659 transitions. [2025-03-03 16:14:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.428571428571429) internal successors, (264), 27 states have internal predecessors, (264), 0 states have call successors, (0), 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-03 16:14:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 284658 states and 357659 transitions. [2025-03-03 16:14:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 16:14:50,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:14:50,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:14:50,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 16:14:50,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 16:14:50,812 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:14:50,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:14:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1490084202, now seen corresponding path program 1 times [2025-03-03 16:14:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:14:50,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260631592] [2025-03-03 16:14:50,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:14:50,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:14:50,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:14:50,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:50,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:14:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260631592] [2025-03-03 16:14:51,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260631592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:14:51,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144664051] [2025-03-03 16:14:51,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:14:51,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:14:51,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:14:51,089 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:14:51,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 16:14:51,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 16:14:51,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 16:14:51,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:14:51,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:14:51,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:14:51,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:14:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:51,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:14:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:14:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144664051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:14:52,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:14:52,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:14:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298531205] [2025-03-03 16:14:52,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:14:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:14:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:14:52,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:14:52,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:14:52,037 INFO L87 Difference]: Start difference. First operand 284658 states and 357659 transitions. Second operand has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 20 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)