./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i -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 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:45:35,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:45:35,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:45:35,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:45:35,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:45:35,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:45:35,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:45:35,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:45:35,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:45:35,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:45:35,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:45:35,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:45:35,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:45:35,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:35,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:45:35,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:45:35,135 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 -> 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 [2025-03-03 19:45:35,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:45:35,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:45:35,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:45:35,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:45:35,393 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:45:35,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-03 19:45:36,511 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5148d9a54/c564ff780aa247018726a2e8fb147c7b/FLAG8e1ca0603 [2025-03-03 19:45:36,752 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:45:36,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-03 19:45:36,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5148d9a54/c564ff780aa247018726a2e8fb147c7b/FLAG8e1ca0603 [2025-03-03 19:45:37,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5148d9a54/c564ff780aa247018726a2e8fb147c7b [2025-03-03 19:45:37,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:45:37,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:45:37,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:37,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:45:37,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:45:37,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400c6fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37, skipping insertion in model container [2025-03-03 19:45:37,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:45:37,213 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i[915,928] [2025-03-03 19:45:37,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:37,366 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:45:37,375 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i[915,928] [2025-03-03 19:45:37,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:45:37,451 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:45:37,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37 WrapperNode [2025-03-03 19:45:37,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:45:37,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:37,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:45:37,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:45:37,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,538 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2025-03-03 19:45:37,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:45:37,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:45:37,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:45:37,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:45:37,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,586 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 19:45:37,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:45:37,619 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:45:37,619 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:45:37,619 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:45:37,620 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (1/1) ... [2025-03-03 19:45:37,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:45:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:37,655 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 19:45:37,657 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 19:45:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:45:37,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:45:37,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:45:37,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:45:37,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:45:37,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:45:37,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:45:37,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:45:38,435 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc property_#t~bitwise62#1;havoc property_#t~short63#1; [2025-03-03 19:45:38,511 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 19:45:38,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:45:38,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:45:38,528 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 19:45:38,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:38 BoogieIcfgContainer [2025-03-03 19:45:38,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:45:38,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:45:38,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:45:38,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:45:38,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:45:37" (1/3) ... [2025-03-03 19:45:38,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7054650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:38, skipping insertion in model container [2025-03-03 19:45:38,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:45:37" (2/3) ... [2025-03-03 19:45:38,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7054650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:45:38, skipping insertion in model container [2025-03-03 19:45:38,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:45:38" (3/3) ... [2025-03-03 19:45:38,540 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-03 19:45:38,550 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:45:38,553 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i that has 2 procedures, 253 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:45:38,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:45:38,608 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;@5b89cba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:45:38,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:45:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 165 states have internal predecessors, (248), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 19:45:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 19:45:38,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:38,631 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:38,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:38,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -277147821, now seen corresponding path program 1 times [2025-03-03 19:45:38,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:38,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866517997] [2025-03-03 19:45:38,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:38,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:45:38,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:45:38,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:38,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-03 19:45:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866517997] [2025-03-03 19:45:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866517997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565852234] [2025-03-03 19:45:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:39,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:39,110 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 19:45:39,112 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 19:45:39,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:45:39,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:45:39,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:39,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:39,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:45:39,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-03 19:45:39,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:45:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565852234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:45:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:45:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866421106] [2025-03-03 19:45:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:45:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:39,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:45:39,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:45:39,489 INFO L87 Difference]: Start difference. First operand has 253 states, 164 states have (on average 1.5121951219512195) internal successors, (248), 165 states have internal predecessors, (248), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:39,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:39,551 INFO L93 Difference]: Finished difference Result 500 states and 921 transitions. [2025-03-03 19:45:39,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:45:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-03-03 19:45:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:39,560 INFO L225 Difference]: With dead ends: 500 [2025-03-03 19:45:39,563 INFO L226 Difference]: Without dead ends: 250 [2025-03-03 19:45:39,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 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 19:45:39,571 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:39,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-03 19:45:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2025-03-03 19:45:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 162 states have internal predecessors, (241), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 19:45:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 413 transitions. [2025-03-03 19:45:39,638 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 413 transitions. Word has length 535 [2025-03-03 19:45:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:39,639 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 413 transitions. [2025-03-03 19:45:39,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 413 transitions. [2025-03-03 19:45:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 19:45:39,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:39,650 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:39,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:45:39,850 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,SelfDestructingSolverStorable0 [2025-03-03 19:45:39,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:39,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1158457809, now seen corresponding path program 1 times [2025-03-03 19:45:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429934838] [2025-03-03 19:45:39,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:45:39,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:45:39,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:39,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:40,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:40,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429934838] [2025-03-03 19:45:40,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429934838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:40,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990824761] [2025-03-03 19:45:40,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:40,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:40,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:40,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:40,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:40,507 INFO L87 Difference]: Start difference. First operand 250 states and 413 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:40,565 INFO L93 Difference]: Finished difference Result 498 states and 825 transitions. [2025-03-03 19:45:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 535 [2025-03-03 19:45:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:40,574 INFO L225 Difference]: With dead ends: 498 [2025-03-03 19:45:40,574 INFO L226 Difference]: Without dead ends: 251 [2025-03-03 19:45:40,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:45:40,577 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:40,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 798 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-03 19:45:40,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-03 19:45:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 163 states have (on average 1.4846625766871167) internal successors, (242), 163 states have internal predecessors, (242), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 19:45:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 414 transitions. [2025-03-03 19:45:40,609 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 414 transitions. Word has length 535 [2025-03-03 19:45:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:40,611 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 414 transitions. [2025-03-03 19:45:40,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 414 transitions. [2025-03-03 19:45:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:45:40,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:40,627 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:40,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:45:40,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:40,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:40,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1530367933, now seen corresponding path program 1 times [2025-03-03 19:45:40,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:40,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594792937] [2025-03-03 19:45:40,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:40,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:40,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:45:40,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:45:40,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:40,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:41,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:41,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:41,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594792937] [2025-03-03 19:45:41,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594792937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:41,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:41,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:41,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248675213] [2025-03-03 19:45:41,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:41,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:41,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:41,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:41,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:41,203 INFO L87 Difference]: Start difference. First operand 251 states and 414 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:41,297 INFO L93 Difference]: Finished difference Result 747 states and 1236 transitions. [2025-03-03 19:45:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:41,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:45:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:41,303 INFO L225 Difference]: With dead ends: 747 [2025-03-03 19:45:41,304 INFO L226 Difference]: Without dead ends: 499 [2025-03-03 19:45:41,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 19:45:41,306 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 224 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:41,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 801 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:41,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-03 19:45:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2025-03-03 19:45:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 322 states have (on average 1.4782608695652173) internal successors, (476), 322 states have internal predecessors, (476), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-03 19:45:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 820 transitions. [2025-03-03 19:45:41,380 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 820 transitions. Word has length 537 [2025-03-03 19:45:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:41,381 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 820 transitions. [2025-03-03 19:45:41,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 820 transitions. [2025-03-03 19:45:41,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 19:45:41,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:41,385 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:45:41,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 290199752, now seen corresponding path program 1 times [2025-03-03 19:45:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038580977] [2025-03-03 19:45:41,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:41,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 19:45:41,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 19:45:41,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:41,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038580977] [2025-03-03 19:45:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038580977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783734815] [2025-03-03 19:45:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:41,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:41,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:41,588 INFO L87 Difference]: Start difference. First operand 497 states and 820 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:41,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:41,660 INFO L93 Difference]: Finished difference Result 1055 states and 1732 transitions. [2025-03-03 19:45:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 538 [2025-03-03 19:45:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:41,668 INFO L225 Difference]: With dead ends: 1055 [2025-03-03 19:45:41,668 INFO L226 Difference]: Without dead ends: 561 [2025-03-03 19:45:41,669 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 19:45:41,670 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 43 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:41,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 818 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-03 19:45:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 515. [2025-03-03 19:45:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 340 states have (on average 1.4764705882352942) internal successors, (502), 340 states have internal predecessors, (502), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-03 19:45:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 846 transitions. [2025-03-03 19:45:41,739 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 846 transitions. Word has length 538 [2025-03-03 19:45:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:41,742 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 846 transitions. [2025-03-03 19:45:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 846 transitions. [2025-03-03 19:45:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 19:45:41,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:41,746 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:45:41,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 144435145, now seen corresponding path program 1 times [2025-03-03 19:45:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067122065] [2025-03-03 19:45:41,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:41,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 19:45:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 19:45:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067122065] [2025-03-03 19:45:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067122065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:42,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37241589] [2025-03-03 19:45:42,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:42,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:42,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:42,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:42,022 INFO L87 Difference]: Start difference. First operand 515 states and 846 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:42,159 INFO L93 Difference]: Finished difference Result 1531 states and 2522 transitions. [2025-03-03 19:45:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 538 [2025-03-03 19:45:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:42,166 INFO L225 Difference]: With dead ends: 1531 [2025-03-03 19:45:42,167 INFO L226 Difference]: Without dead ends: 1019 [2025-03-03 19:45:42,169 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 19:45:42,169 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 397 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:42,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1161 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:42,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-03-03 19:45:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1017. [2025-03-03 19:45:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 668 states have (on average 1.473053892215569) internal successors, (984), 668 states have internal predecessors, (984), 344 states have call successors, (344), 4 states have call predecessors, (344), 4 states have return successors, (344), 344 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-03 19:45:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1672 transitions. [2025-03-03 19:45:42,323 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1672 transitions. Word has length 538 [2025-03-03 19:45:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:42,324 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1672 transitions. [2025-03-03 19:45:42,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1672 transitions. [2025-03-03 19:45:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 19:45:42,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:42,329 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:42,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:45:42,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:42,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 113829703, now seen corresponding path program 1 times [2025-03-03 19:45:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:42,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158430828] [2025-03-03 19:45:42,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:42,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 19:45:42,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 19:45:42,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:42,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:42,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:42,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158430828] [2025-03-03 19:45:42,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158430828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:45:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414297048] [2025-03-03 19:45:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:42,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:45:42,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:42,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:45:42,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:42,927 INFO L87 Difference]: Start difference. First operand 1017 states and 1672 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:43,150 INFO L93 Difference]: Finished difference Result 2597 states and 4274 transitions. [2025-03-03 19:45:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:45:43,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 539 [2025-03-03 19:45:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:43,159 INFO L225 Difference]: With dead ends: 2597 [2025-03-03 19:45:43,160 INFO L226 Difference]: Without dead ends: 1583 [2025-03-03 19:45:43,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:45:43,163 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 221 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:43,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1526 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:45:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-03-03 19:45:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1573. [2025-03-03 19:45:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1160 states have (on average 1.5379310344827586) internal successors, (1784), 1164 states have internal predecessors, (1784), 404 states have call successors, (404), 8 states have call predecessors, (404), 8 states have return successors, (404), 400 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-03 19:45:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2592 transitions. [2025-03-03 19:45:43,267 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2592 transitions. Word has length 539 [2025-03-03 19:45:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:43,268 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2592 transitions. [2025-03-03 19:45:43,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2592 transitions. [2025-03-03 19:45:43,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 19:45:43,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:43,271 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:43,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:45:43,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:43,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash 744288328, now seen corresponding path program 1 times [2025-03-03 19:45:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:43,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423720436] [2025-03-03 19:45:43,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:43,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 19:45:43,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 19:45:43,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:43,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:43,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:43,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423720436] [2025-03-03 19:45:43,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423720436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:43,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:45:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858759938] [2025-03-03 19:45:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:43,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:45:43,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:43,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:45:43,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:45:43,929 INFO L87 Difference]: Start difference. First operand 1573 states and 2592 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:45,127 INFO L93 Difference]: Finished difference Result 4731 states and 7803 transitions. [2025-03-03 19:45:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:45:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-03-03 19:45:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:45,148 INFO L225 Difference]: With dead ends: 4731 [2025-03-03 19:45:45,148 INFO L226 Difference]: Without dead ends: 3945 [2025-03-03 19:45:45,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:45:45,153 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 978 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:45,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1798 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:45:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-03 19:45:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3925. [2025-03-03 19:45:45,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 2894 states have (on average 1.5418106427090532) internal successors, (4462), 2904 states have internal predecessors, (4462), 1010 states have call successors, (1010), 20 states have call predecessors, (1010), 20 states have return successors, (1010), 1000 states have call predecessors, (1010), 1010 states have call successors, (1010) [2025-03-03 19:45:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6482 transitions. [2025-03-03 19:45:45,410 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6482 transitions. Word has length 539 [2025-03-03 19:45:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 3925 states and 6482 transitions. [2025-03-03 19:45:45,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6482 transitions. [2025-03-03 19:45:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 19:45:45,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:45,414 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:45,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:45:45,415 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:45,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash -3446616, now seen corresponding path program 1 times [2025-03-03 19:45:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113095801] [2025-03-03 19:45:45,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:45,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 19:45:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 19:45:45,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:46,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:46,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113095801] [2025-03-03 19:45:46,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113095801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:46,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:46,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:45:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115920943] [2025-03-03 19:45:46,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:46,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:45:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:45:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:45:46,245 INFO L87 Difference]: Start difference. First operand 3925 states and 6482 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:48,178 INFO L93 Difference]: Finished difference Result 22794 states and 37520 transitions. [2025-03-03 19:45:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 19:45:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-03-03 19:45:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:48,260 INFO L225 Difference]: With dead ends: 22794 [2025-03-03 19:45:48,261 INFO L226 Difference]: Without dead ends: 18872 [2025-03-03 19:45:48,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:45:48,276 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2990 mSDsluCounter, 2652 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2990 SdHoareTripleChecker+Valid, 3092 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:48,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2990 Valid, 3092 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:45:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18872 states. [2025-03-03 19:45:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18872 to 8255. [2025-03-03 19:45:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8255 states, 6654 states have (on average 1.5755936278929967) internal successors, (10484), 6694 states have internal predecessors, (10484), 1540 states have call successors, (1540), 60 states have call predecessors, (1540), 60 states have return successors, (1540), 1500 states have call predecessors, (1540), 1540 states have call successors, (1540) [2025-03-03 19:45:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8255 states to 8255 states and 13564 transitions. [2025-03-03 19:45:49,099 INFO L78 Accepts]: Start accepts. Automaton has 8255 states and 13564 transitions. Word has length 539 [2025-03-03 19:45:49,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 8255 states and 13564 transitions. [2025-03-03 19:45:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 8255 states and 13564 transitions. [2025-03-03 19:45:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 19:45:49,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:49,104 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:49,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:45:49,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash -318116213, now seen corresponding path program 1 times [2025-03-03 19:45:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770383474] [2025-03-03 19:45:49,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:49,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 19:45:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 19:45:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:50,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:50,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770383474] [2025-03-03 19:45:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770383474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:50,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:45:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655067943] [2025-03-03 19:45:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:50,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:45:50,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:50,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:45:50,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:50,421 INFO L87 Difference]: Start difference. First operand 8255 states and 13564 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:51,750 INFO L93 Difference]: Finished difference Result 29361 states and 47957 transitions. [2025-03-03 19:45:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:45:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 540 [2025-03-03 19:45:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:51,815 INFO L225 Difference]: With dead ends: 29361 [2025-03-03 19:45:51,815 INFO L226 Difference]: Without dead ends: 21109 [2025-03-03 19:45:51,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:45:51,843 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 482 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:51,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1158 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:45:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21109 states. [2025-03-03 19:45:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21109 to 15345. [2025-03-03 19:45:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15345 states, 12604 states have (on average 1.5752142177086639) internal successors, (19854), 12694 states have internal predecessors, (19854), 2620 states have call successors, (2620), 120 states have call predecessors, (2620), 120 states have return successors, (2620), 2530 states have call predecessors, (2620), 2620 states have call successors, (2620) [2025-03-03 19:45:52,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15345 states to 15345 states and 25094 transitions. [2025-03-03 19:45:52,982 INFO L78 Accepts]: Start accepts. Automaton has 15345 states and 25094 transitions. Word has length 540 [2025-03-03 19:45:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:52,983 INFO L471 AbstractCegarLoop]: Abstraction has 15345 states and 25094 transitions. [2025-03-03 19:45:52,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 15345 states and 25094 transitions. [2025-03-03 19:45:52,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 19:45:52,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:52,989 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:52,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:45:52,989 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:52,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:52,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1632184042, now seen corresponding path program 1 times [2025-03-03 19:45:52,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:52,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800267118] [2025-03-03 19:45:52,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:52,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:53,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 19:45:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 19:45:53,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:53,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 180 proven. 75 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-03 19:45:53,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800267118] [2025-03-03 19:45:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800267118] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746005153] [2025-03-03 19:45:53,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:53,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:53,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:53,603 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 19:45:53,605 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 19:45:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 19:45:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 19:45:53,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:53,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:45:53,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3489 proven. 33 refuted. 0 times theorem prover too weak. 11098 trivial. 0 not checked. [2025-03-03 19:45:54,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:45:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 222 proven. 33 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-03 19:45:54,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746005153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:45:54,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:45:54,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 19:45:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253300551] [2025-03-03 19:45:54,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:45:54,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:45:54,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:54,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:45:54,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:45:54,486 INFO L87 Difference]: Start difference. First operand 15345 states and 25094 transitions. Second operand has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-03 19:45:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:56,043 INFO L93 Difference]: Finished difference Result 31027 states and 50495 transitions. [2025-03-03 19:45:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 19:45:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) Word has length 540 [2025-03-03 19:45:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:56,105 INFO L225 Difference]: With dead ends: 31027 [2025-03-03 19:45:56,106 INFO L226 Difference]: Without dead ends: 15685 [2025-03-03 19:45:56,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1077 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:45:56,144 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1014 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:56,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 737 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:45:56,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15685 states. [2025-03-03 19:45:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15685 to 15465. [2025-03-03 19:45:57,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15465 states, 12694 states have (on average 1.54750275720813) internal successors, (19644), 12784 states have internal predecessors, (19644), 2620 states have call successors, (2620), 150 states have call predecessors, (2620), 150 states have return successors, (2620), 2530 states have call predecessors, (2620), 2620 states have call successors, (2620) [2025-03-03 19:45:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15465 states to 15465 states and 24884 transitions. [2025-03-03 19:45:57,219 INFO L78 Accepts]: Start accepts. Automaton has 15465 states and 24884 transitions. Word has length 540 [2025-03-03 19:45:57,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:57,220 INFO L471 AbstractCegarLoop]: Abstraction has 15465 states and 24884 transitions. [2025-03-03 19:45:57,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.333333333333332) internal successors, (165), 9 states have internal predecessors, (165), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-03 19:45:57,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15465 states and 24884 transitions. [2025-03-03 19:45:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 19:45:57,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:57,226 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:57,234 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 19:45:57,430 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,SelfDestructingSolverStorable9 [2025-03-03 19:45:57,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:57,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:57,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1533962065, now seen corresponding path program 1 times [2025-03-03 19:45:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149350631] [2025-03-03 19:45:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:57,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 19:45:57,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 19:45:57,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:57,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 264 proven. 240 refuted. 0 times theorem prover too weak. 14116 trivial. 0 not checked. [2025-03-03 19:45:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149350631] [2025-03-03 19:45:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149350631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995251410] [2025-03-03 19:45:58,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:58,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:58,034 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 19:45:58,036 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 19:45:58,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 19:45:58,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 19:45:58,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:58,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:58,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 19:45:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 8580 proven. 240 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2025-03-03 19:45:59,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:45:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 264 proven. 243 refuted. 0 times theorem prover too weak. 14113 trivial. 0 not checked. [2025-03-03 19:45:59,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995251410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:45:59,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:45:59,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 17 [2025-03-03 19:45:59,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576729737] [2025-03-03 19:45:59,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:45:59,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:45:59,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:59,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:45:59,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:45:59,675 INFO L87 Difference]: Start difference. First operand 15465 states and 24884 transitions. Second operand has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) [2025-03-03 19:46:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:03,701 INFO L93 Difference]: Finished difference Result 49491 states and 78567 transitions. [2025-03-03 19:46:03,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-03 19:46:03,702 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) Word has length 541 [2025-03-03 19:46:03,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:03,817 INFO L225 Difference]: With dead ends: 49491 [2025-03-03 19:46:03,818 INFO L226 Difference]: Without dead ends: 33629 [2025-03-03 19:46:03,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1077 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=628, Invalid=1724, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 19:46:03,858 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1684 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 2148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:03,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 1572 Invalid, 2148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:46:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2025-03-03 19:46:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 21435. [2025-03-03 19:46:06,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21435 states, 17454 states have (on average 1.5282456743439898) internal successors, (26674), 17594 states have internal predecessors, (26674), 3720 states have call successors, (3720), 260 states have call predecessors, (3720), 260 states have return successors, (3720), 3580 states have call predecessors, (3720), 3720 states have call successors, (3720) [2025-03-03 19:46:06,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21435 states to 21435 states and 34114 transitions. [2025-03-03 19:46:06,300 INFO L78 Accepts]: Start accepts. Automaton has 21435 states and 34114 transitions. Word has length 541 [2025-03-03 19:46:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:06,301 INFO L471 AbstractCegarLoop]: Abstraction has 21435 states and 34114 transitions. [2025-03-03 19:46:06,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.411764705882353) internal successors, (177), 17 states have internal predecessors, (177), 4 states have call successors, (131), 3 states have call predecessors, (131), 7 states have return successors, (133), 4 states have call predecessors, (133), 4 states have call successors, (133) [2025-03-03 19:46:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 21435 states and 34114 transitions. [2025-03-03 19:46:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 19:46:06,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:06,314 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:06,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 19:46:06,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:06,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:06,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -731463983, now seen corresponding path program 1 times [2025-03-03 19:46:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321247722] [2025-03-03 19:46:06,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:06,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 19:46:06,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 19:46:06,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 66 proven. 189 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-03 19:46:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321247722] [2025-03-03 19:46:07,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321247722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:46:07,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417029288] [2025-03-03 19:46:07,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:07,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:07,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:46:07,356 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 19:46:07,359 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 19:46:07,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 19:46:07,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 19:46:07,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:07,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:07,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 19:46:07,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:46:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3908 proven. 660 refuted. 0 times theorem prover too weak. 10052 trivial. 0 not checked. [2025-03-03 19:46:09,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:46:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 87 proven. 669 refuted. 0 times theorem prover too weak. 13864 trivial. 0 not checked. [2025-03-03 19:46:11,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417029288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:46:11,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:46:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 12] total 24 [2025-03-03 19:46:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91346218] [2025-03-03 19:46:11,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:46:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 19:46:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 19:46:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-03 19:46:11,992 INFO L87 Difference]: Start difference. First operand 21435 states and 34114 transitions. Second operand has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) [2025-03-03 19:46:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:16,319 INFO L93 Difference]: Finished difference Result 50479 states and 78102 transitions. [2025-03-03 19:46:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-03 19:46:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) Word has length 541 [2025-03-03 19:46:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:16,431 INFO L225 Difference]: With dead ends: 50479 [2025-03-03 19:46:16,431 INFO L226 Difference]: Without dead ends: 29047 [2025-03-03 19:46:16,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=986, Invalid=2554, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 19:46:16,484 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1650 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:16,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1842 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:46:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29047 states. [2025-03-03 19:46:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29047 to 26381. [2025-03-03 19:46:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26381 states, 21910 states have (on average 1.4975810132359653) internal successors, (32812), 22078 states have internal predecessors, (32812), 3816 states have call successors, (3816), 654 states have call predecessors, (3816), 654 states have return successors, (3816), 3648 states have call predecessors, (3816), 3816 states have call successors, (3816) [2025-03-03 19:46:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26381 states to 26381 states and 40444 transitions. [2025-03-03 19:46:19,260 INFO L78 Accepts]: Start accepts. Automaton has 26381 states and 40444 transitions. Word has length 541 [2025-03-03 19:46:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:19,261 INFO L471 AbstractCegarLoop]: Abstraction has 26381 states and 40444 transitions. [2025-03-03 19:46:19,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.041666666666666) internal successors, (337), 24 states have internal predecessors, (337), 9 states have call successors, (251), 4 states have call predecessors, (251), 10 states have return successors, (252), 9 states have call predecessors, (252), 9 states have call successors, (252) [2025-03-03 19:46:19,262 INFO L276 IsEmpty]: Start isEmpty. Operand 26381 states and 40444 transitions. [2025-03-03 19:46:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 19:46:19,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:19,275 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:19,283 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 19:46:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:46:19,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:19,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1494326222, now seen corresponding path program 1 times [2025-03-03 19:46:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:19,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841474472] [2025-03-03 19:46:19,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:19,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:19,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 19:46:19,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 19:46:19,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:19,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:46:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:19,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841474472] [2025-03-03 19:46:19,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841474472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:19,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:19,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:46:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195969767] [2025-03-03 19:46:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:46:19,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:19,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:46:19,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:46:19,774 INFO L87 Difference]: Start difference. First operand 26381 states and 40444 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:46:22,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:22,673 INFO L93 Difference]: Finished difference Result 39723 states and 61026 transitions. [2025-03-03 19:46:22,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:46:22,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 543 [2025-03-03 19:46:22,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:22,771 INFO L225 Difference]: With dead ends: 39723 [2025-03-03 19:46:22,771 INFO L226 Difference]: Without dead ends: 26503 [2025-03-03 19:46:22,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:46:22,808 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 226 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:22,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1771 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:46:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26503 states. [2025-03-03 19:46:24,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26503 to 17629. [2025-03-03 19:46:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17629 states, 14648 states have (on average 1.4961769524849808) internal successors, (21916), 14760 states have internal predecessors, (21916), 2544 states have call successors, (2544), 436 states have call predecessors, (2544), 436 states have return successors, (2544), 2432 states have call predecessors, (2544), 2544 states have call successors, (2544) [2025-03-03 19:46:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17629 states to 17629 states and 27004 transitions. [2025-03-03 19:46:24,959 INFO L78 Accepts]: Start accepts. Automaton has 17629 states and 27004 transitions. Word has length 543 [2025-03-03 19:46:24,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:24,959 INFO L471 AbstractCegarLoop]: Abstraction has 17629 states and 27004 transitions. [2025-03-03 19:46:24,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:46:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 17629 states and 27004 transitions. [2025-03-03 19:46:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 19:46:24,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:24,974 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:46:24,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:24,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:24,975 INFO L85 PathProgramCache]: Analyzing trace with hash 315158725, now seen corresponding path program 1 times [2025-03-03 19:46:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271399312] [2025-03-03 19:46:24,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:24,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:24,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 19:46:25,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 19:46:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:46:25,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:25,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271399312] [2025-03-03 19:46:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271399312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:25,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:25,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:46:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458086502] [2025-03-03 19:46:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:25,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:46:25,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:25,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:46:25,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:46:25,357 INFO L87 Difference]: Start difference. First operand 17629 states and 27004 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:46:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:30,591 INFO L93 Difference]: Finished difference Result 57349 states and 87907 transitions. [2025-03-03 19:46:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:46:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 543 [2025-03-03 19:46:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:30,725 INFO L225 Difference]: With dead ends: 57349 [2025-03-03 19:46:30,725 INFO L226 Difference]: Without dead ends: 52941 [2025-03-03 19:46:30,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:46:30,746 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 1122 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:30,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1446 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:46:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52941 states. [2025-03-03 19:46:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52941 to 44065. [2025-03-03 19:46:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44065 states, 36614 states have (on average 1.4962582618670455) internal successors, (54784), 36894 states have internal predecessors, (54784), 6360 states have call successors, (6360), 1090 states have call predecessors, (6360), 1090 states have return successors, (6360), 6080 states have call predecessors, (6360), 6360 states have call successors, (6360) [2025-03-03 19:46:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44065 states to 44065 states and 67504 transitions. [2025-03-03 19:46:35,257 INFO L78 Accepts]: Start accepts. Automaton has 44065 states and 67504 transitions. Word has length 543 [2025-03-03 19:46:35,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:35,258 INFO L471 AbstractCegarLoop]: Abstraction has 44065 states and 67504 transitions. [2025-03-03 19:46:35,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:46:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 44065 states and 67504 transitions. [2025-03-03 19:46:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 19:46:35,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:35,271 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:46:35,271 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:35,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 44605452, now seen corresponding path program 1 times [2025-03-03 19:46:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174252996] [2025-03-03 19:46:35,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:35,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 19:46:35,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 19:46:35,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:35,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:46:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174252996] [2025-03-03 19:46:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174252996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:46:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183890461] [2025-03-03 19:46:35,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:35,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:46:35,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:35,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:46:35,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:46:35,600 INFO L87 Difference]: Start difference. First operand 44065 states and 67504 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:46:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:46:41,640 INFO L93 Difference]: Finished difference Result 93175 states and 142327 transitions. [2025-03-03 19:46:41,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:46:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 543 [2025-03-03 19:46:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:46:41,832 INFO L225 Difference]: With dead ends: 93175 [2025-03-03 19:46:41,832 INFO L226 Difference]: Without dead ends: 71053 [2025-03-03 19:46:41,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:46:41,898 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 595 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:46:41,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1560 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:46:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71053 states. [2025-03-03 19:46:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71053 to 64989. [2025-03-03 19:46:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64989 states, 54558 states have (on average 1.4981487591187361) internal successors, (81736), 54950 states have internal predecessors, (81736), 8904 states have call successors, (8904), 1526 states have call predecessors, (8904), 1526 states have return successors, (8904), 8512 states have call predecessors, (8904), 8904 states have call successors, (8904) [2025-03-03 19:46:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64989 states to 64989 states and 99544 transitions. [2025-03-03 19:46:48,737 INFO L78 Accepts]: Start accepts. Automaton has 64989 states and 99544 transitions. Word has length 543 [2025-03-03 19:46:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:46:48,738 INFO L471 AbstractCegarLoop]: Abstraction has 64989 states and 99544 transitions. [2025-03-03 19:46:48,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:46:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 64989 states and 99544 transitions. [2025-03-03 19:46:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 19:46:48,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:46:48,751 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:46:48,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:46:48,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:46:48,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:46:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash 703134777, now seen corresponding path program 1 times [2025-03-03 19:46:48,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:46:48,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195862283] [2025-03-03 19:46:48,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:46:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:46:48,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 19:46:48,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 19:46:48,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:46:48,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:46:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:46:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:46:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195862283] [2025-03-03 19:46:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195862283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:46:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:46:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 19:46:49,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419485101] [2025-03-03 19:46:49,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:46:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:46:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:46:49,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:46:49,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:46:49,411 INFO L87 Difference]: Start difference. First operand 64989 states and 99544 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86)