./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.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_operatoramount_amount250_file-28.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 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:09:23,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:09:23,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:09:23,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:09:23,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:09:23,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:09:23,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:09:23,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:09:23,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:09:23,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:09:23,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:09:23,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:09:23,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:09:23,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:09:23,447 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:09:23,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:09:23,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:09:23,449 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:09:23,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:23,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:09:23,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:09:23,451 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 -> 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 [2025-03-04 00:09:23,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:09:23,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:09:23,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:09:23,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:09:23,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:09:23,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2025-03-04 00:09:24,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45fa6316/ea0ae4060449448d83633d741431405b/FLAG161aceef8 [2025-03-04 00:09:25,084 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:09:25,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2025-03-04 00:09:25,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45fa6316/ea0ae4060449448d83633d741431405b/FLAG161aceef8 [2025-03-04 00:09:25,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45fa6316/ea0ae4060449448d83633d741431405b [2025-03-04 00:09:25,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:09:25,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:09:25,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:25,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:09:25,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:09:25,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fc30a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25, skipping insertion in model container [2025-03-04 00:09:25,123 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:09:25,258 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_operatoramount_amount250_file-28.i[916,929] [2025-03-04 00:09:25,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:25,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:09:25,430 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_operatoramount_amount250_file-28.i[916,929] [2025-03-04 00:09:25,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:09:25,497 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:09:25,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25 WrapperNode [2025-03-04 00:09:25,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:09:25,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:25,500 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:09:25,500 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:09:25,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,565 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2025-03-04 00:09:25,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:09:25,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:09:25,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:09:25,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:09:25,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,591 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,630 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-04 00:09:25,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,655 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:09:25,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:09:25,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:09:25,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:09:25,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (1/1) ... [2025-03-04 00:09:25,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:09:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:25,721 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-04 00:09:25,738 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-04 00:09:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:09:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:09:25,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:09:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:09:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:09:25,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:09:25,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:09:25,848 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:09:26,512 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: havoc property_#t~ite32#1;havoc property_#t~ite31#1;havoc property_#t~bitwise30#1;havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~short36#1; [2025-03-04 00:09:26,557 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-04 00:09:26,557 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:09:26,575 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:09:26,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:09:26,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:26 BoogieIcfgContainer [2025-03-04 00:09:26,578 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:09:26,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:09:26,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:09:26,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:09:26,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:09:25" (1/3) ... [2025-03-04 00:09:26,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f4429c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:26, skipping insertion in model container [2025-03-04 00:09:26,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:09:25" (2/3) ... [2025-03-04 00:09:26,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f4429c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:09:26, skipping insertion in model container [2025-03-04 00:09:26,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:09:26" (3/3) ... [2025-03-04 00:09:26,586 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-28.i [2025-03-04 00:09:26,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:09:26,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-28.i that has 2 procedures, 171 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:09:26,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:09:26,660 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;@66bf82ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:09:26,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:09:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:09:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:09:26,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:26,677 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:26,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:26,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:26,681 INFO L85 PathProgramCache]: Analyzing trace with hash 203321212, now seen corresponding path program 1 times [2025-03-04 00:09:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262206549] [2025-03-04 00:09:26,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:26,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:26,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:26,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:09:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262206549] [2025-03-04 00:09:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262206549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080572220] [2025-03-04 00:09:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:27,127 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-04 00:09:27,129 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-04 00:09:27,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:27,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:27,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:27,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:27,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:09:27,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-03-04 00:09:27,394 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:09:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080572220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:09:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:09:27,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128466887] [2025-03-04 00:09:27,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:27,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:09:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:27,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:09:27,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:09:27,417 INFO L87 Difference]: Start difference. First operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:09:27,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:27,461 INFO L93 Difference]: Finished difference Result 336 states and 588 transitions. [2025-03-04 00:09:27,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:09:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 297 [2025-03-04 00:09:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:27,467 INFO L225 Difference]: With dead ends: 336 [2025-03-04 00:09:27,468 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 00:09:27,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 298 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-04 00:09:27,472 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:27,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:27,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 00:09:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-04 00:09:27,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.4959349593495934) internal successors, (184), 123 states have internal predecessors, (184), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-03-04 00:09:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 270 transitions. [2025-03-04 00:09:27,523 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 270 transitions. Word has length 297 [2025-03-04 00:09:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:27,524 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 270 transitions. [2025-03-04 00:09:27,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:09:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 270 transitions. [2025-03-04 00:09:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:09:27,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:27,531 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:27,539 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-04 00:09:27,732 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-04 00:09:27,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:27,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:27,734 INFO L85 PathProgramCache]: Analyzing trace with hash 342424793, now seen corresponding path program 1 times [2025-03-04 00:09:27,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:27,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518705467] [2025-03-04 00:09:27,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:27,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:27,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:27,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:27,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:28,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518705467] [2025-03-04 00:09:28,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518705467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:28,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398379141] [2025-03-04 00:09:28,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:28,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:28,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:28,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:28,082 INFO L87 Difference]: Start difference. First operand 168 states and 270 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:28,186 INFO L93 Difference]: Finished difference Result 462 states and 742 transitions. [2025-03-04 00:09:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-03-04 00:09:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:28,194 INFO L225 Difference]: With dead ends: 462 [2025-03-04 00:09:28,194 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 00:09:28,196 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-04 00:09:28,198 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:28,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 607 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 00:09:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2025-03-04 00:09:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.5066666666666666) internal successors, (339), 226 states have internal predecessors, (339), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:09:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 471 transitions. [2025-03-04 00:09:28,230 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 471 transitions. Word has length 297 [2025-03-04 00:09:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:28,231 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 471 transitions. [2025-03-04 00:09:28,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:28,232 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 471 transitions. [2025-03-04 00:09:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:09:28,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:28,239 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:28,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:09:28,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:28,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -106271846, now seen corresponding path program 1 times [2025-03-04 00:09:28,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:28,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605751783] [2025-03-04 00:09:28,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:28,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:28,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:28,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:28,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:28,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:29,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:29,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605751783] [2025-03-04 00:09:29,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605751783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:29,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:29,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139306230] [2025-03-04 00:09:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:29,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:29,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:29,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:29,174 INFO L87 Difference]: Start difference. First operand 294 states and 471 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:29,535 INFO L93 Difference]: Finished difference Result 776 states and 1239 transitions. [2025-03-04 00:09:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:29,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-03-04 00:09:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:29,541 INFO L225 Difference]: With dead ends: 776 [2025-03-04 00:09:29,541 INFO L226 Difference]: Without dead ends: 485 [2025-03-04 00:09:29,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:29,542 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 179 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:29,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 667 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:09:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-04 00:09:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 332. [2025-03-04 00:09:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 263 states have (on average 1.5247148288973384) internal successors, (401), 264 states have internal predecessors, (401), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:09:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 533 transitions. [2025-03-04 00:09:29,571 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 533 transitions. Word has length 297 [2025-03-04 00:09:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:29,571 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 533 transitions. [2025-03-04 00:09:29,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 533 transitions. [2025-03-04 00:09:29,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:09:29,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:29,574 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:09:29,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1086380791, now seen corresponding path program 1 times [2025-03-04 00:09:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936875654] [2025-03-04 00:09:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:29,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:29,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:29,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:29,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:30,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936875654] [2025-03-04 00:09:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936875654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876444407] [2025-03-04 00:09:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:30,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:30,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:30,105 INFO L87 Difference]: Start difference. First operand 332 states and 533 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:30,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:30,186 INFO L93 Difference]: Finished difference Result 661 states and 1063 transitions. [2025-03-04 00:09:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:30,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-03-04 00:09:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:30,190 INFO L225 Difference]: With dead ends: 661 [2025-03-04 00:09:30,190 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 00:09:30,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:30,191 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:30,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 00:09:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-04 00:09:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 263 states have (on average 1.5171102661596958) internal successors, (399), 264 states have internal predecessors, (399), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:09:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 531 transitions. [2025-03-04 00:09:30,216 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 531 transitions. Word has length 297 [2025-03-04 00:09:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:30,218 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 531 transitions. [2025-03-04 00:09:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 531 transitions. [2025-03-04 00:09:30,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-04 00:09:30,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:30,222 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:30,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:09:30,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:30,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:30,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1297731704, now seen corresponding path program 1 times [2025-03-04 00:09:30,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:30,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476725241] [2025-03-04 00:09:30,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:30,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:31,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:31,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:31,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:09:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476725241] [2025-03-04 00:09:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476725241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:09:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316083259] [2025-03-04 00:09:31,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:31,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:09:31,529 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-04 00:09:31,531 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-04 00:09:31,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-04 00:09:31,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-04 00:09:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:31,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:09:31,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:09:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 588 proven. 9 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2025-03-04 00:09:31,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:09:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 117 proven. 9 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-03-04 00:09:32,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316083259] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:09:32,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:09:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-04 00:09:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870246521] [2025-03-04 00:09:32,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:09:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:09:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:32,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:09:32,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:09:32,212 INFO L87 Difference]: Start difference. First operand 332 states and 531 transitions. Second operand has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-03-04 00:09:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:32,671 INFO L93 Difference]: Finished difference Result 681 states and 1076 transitions. [2025-03-04 00:09:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 00:09:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 297 [2025-03-04 00:09:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:32,675 INFO L225 Difference]: With dead ends: 681 [2025-03-04 00:09:32,675 INFO L226 Difference]: Without dead ends: 352 [2025-03-04 00:09:32,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:09:32,678 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 428 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:32,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 706 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:09:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-04 00:09:32,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2025-03-04 00:09:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 272 states have (on average 1.4705882352941178) internal successors, (400), 273 states have internal predecessors, (400), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-04 00:09:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 532 transitions. [2025-03-04 00:09:32,708 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 532 transitions. Word has length 297 [2025-03-04 00:09:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:32,709 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 532 transitions. [2025-03-04 00:09:32,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-03-04 00:09:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 532 transitions. [2025-03-04 00:09:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:09:32,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:32,714 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:32,722 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-04 00:09:32,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:09:32,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:32,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2143529413, now seen corresponding path program 1 times [2025-03-04 00:09:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:32,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078553729] [2025-03-04 00:09:32,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:32,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:09:33,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:09:33,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:33,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078553729] [2025-03-04 00:09:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078553729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:45,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:09:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515702102] [2025-03-04 00:09:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:45,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:09:45,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:45,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:09:45,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:09:45,861 INFO L87 Difference]: Start difference. First operand 344 states and 532 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:09:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:48,604 INFO L93 Difference]: Finished difference Result 1473 states and 2257 transitions. [2025-03-04 00:09:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:09:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-03-04 00:09:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:48,610 INFO L225 Difference]: With dead ends: 1473 [2025-03-04 00:09:48,610 INFO L226 Difference]: Without dead ends: 1102 [2025-03-04 00:09:48,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:09:48,612 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 878 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:48,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 2138 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 00:09:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-04 00:09:48,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 662. [2025-03-04 00:09:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 535 states have (on average 1.4710280373831777) internal successors, (787), 538 states have internal predecessors, (787), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 00:09:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1017 transitions. [2025-03-04 00:09:48,660 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1017 transitions. Word has length 299 [2025-03-04 00:09:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1017 transitions. [2025-03-04 00:09:48,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:09:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1017 transitions. [2025-03-04 00:09:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:09:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:48,667 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:09:48,667 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:48,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1118037414, now seen corresponding path program 1 times [2025-03-04 00:09:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668492380] [2025-03-04 00:09:48,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:09:48,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:09:48,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:48,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:49,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:49,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668492380] [2025-03-04 00:09:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668492380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:49,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:49,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:09:49,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353646373] [2025-03-04 00:09:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:49,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:09:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:49,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:09:49,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:09:49,229 INFO L87 Difference]: Start difference. First operand 662 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:49,329 INFO L93 Difference]: Finished difference Result 1551 states and 2390 transitions. [2025-03-04 00:09:49,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:09:49,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-04 00:09:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:49,334 INFO L225 Difference]: With dead ends: 1551 [2025-03-04 00:09:49,334 INFO L226 Difference]: Without dead ends: 964 [2025-03-04 00:09:49,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-04 00:09:49,336 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 328 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:49,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 472 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:09:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-04 00:09:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 778. [2025-03-04 00:09:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 651 states have (on average 1.4700460829493087) internal successors, (957), 654 states have internal predecessors, (957), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 00:09:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1187 transitions. [2025-03-04 00:09:49,371 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1187 transitions. Word has length 299 [2025-03-04 00:09:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1187 transitions. [2025-03-04 00:09:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:49,372 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1187 transitions. [2025-03-04 00:09:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:09:49,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:49,374 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:49,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:09:49,375 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:49,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1358577543, now seen corresponding path program 1 times [2025-03-04 00:09:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312888514] [2025-03-04 00:09:49,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:49,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:49,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:09:49,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:09:49,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:49,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:09:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:09:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:09:49,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312888514] [2025-03-04 00:09:49,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312888514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:09:49,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:09:49,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:09:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951854477] [2025-03-04 00:09:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:09:49,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:09:49,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:09:49,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:09:49,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:09:49,474 INFO L87 Difference]: Start difference. First operand 778 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:09:49,525 INFO L93 Difference]: Finished difference Result 1237 states and 1886 transitions. [2025-03-04 00:09:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:09:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-04 00:09:49,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:09:49,529 INFO L225 Difference]: With dead ends: 1237 [2025-03-04 00:09:49,529 INFO L226 Difference]: Without dead ends: 664 [2025-03-04 00:09:49,530 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-04 00:09:49,531 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 236 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:09:49,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 509 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:09:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-04 00:09:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 654. [2025-03-04 00:09:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 527 states have (on average 1.4402277039848197) internal successors, (759), 530 states have internal predecessors, (759), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 00:09:49,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 989 transitions. [2025-03-04 00:09:49,566 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 989 transitions. Word has length 299 [2025-03-04 00:09:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:09:49,566 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 989 transitions. [2025-03-04 00:09:49,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:09:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 989 transitions. [2025-03-04 00:09:49,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:09:49,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:09:49,569 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:09:49,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:09:49,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:09:49,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:09:49,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1007777606, now seen corresponding path program 1 times [2025-03-04 00:09:49,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:09:49,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431625898] [2025-03-04 00:09:49,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:09:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:09:49,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:09:49,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:09:49,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:09:49,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431625898] [2025-03-04 00:10:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431625898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:12,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:12,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 00:10:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176644011] [2025-03-04 00:10:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:12,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:10:12,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:12,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:10:12,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:10:12,495 INFO L87 Difference]: Start difference. First operand 654 states and 989 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:10:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:14,723 INFO L93 Difference]: Finished difference Result 1693 states and 2566 transitions. [2025-03-04 00:10:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:10:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-03-04 00:10:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:14,729 INFO L225 Difference]: With dead ends: 1693 [2025-03-04 00:10:14,729 INFO L226 Difference]: Without dead ends: 1344 [2025-03-04 00:10:14,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:14,731 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1026 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:14,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1692 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 00:10:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-03-04 00:10:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 728. [2025-03-04 00:10:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 601 states have (on average 1.4492512479201332) internal successors, (871), 604 states have internal predecessors, (871), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-03-04 00:10:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1101 transitions. [2025-03-04 00:10:14,772 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1101 transitions. Word has length 299 [2025-03-04 00:10:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1101 transitions. [2025-03-04 00:10:14,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:10:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1101 transitions. [2025-03-04 00:10:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:10:14,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:14,776 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:14,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:10:14,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1361656379, now seen corresponding path program 1 times [2025-03-04 00:10:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562480222] [2025-03-04 00:10:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:14,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:10:14,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:10:14,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:15,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:15,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562480222] [2025-03-04 00:10:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562480222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:15,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:15,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:10:15,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072709449] [2025-03-04 00:10:15,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:15,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:10:15,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:15,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:10:15,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:15,998 INFO L87 Difference]: Start difference. First operand 728 states and 1101 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:10:19,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:19,075 INFO L93 Difference]: Finished difference Result 1982 states and 2969 transitions. [2025-03-04 00:10:19,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:10:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-04 00:10:19,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:19,085 INFO L225 Difference]: With dead ends: 1982 [2025-03-04 00:10:19,085 INFO L226 Difference]: Without dead ends: 1633 [2025-03-04 00:10:19,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-03-04 00:10:19,088 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1062 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:19,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2447 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 00:10:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-03-04 00:10:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1415. [2025-03-04 00:10:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1146 states have (on average 1.4240837696335078) internal successors, (1632), 1155 states have internal predecessors, (1632), 239 states have call successors, (239), 29 states have call predecessors, (239), 29 states have return successors, (239), 230 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-04 00:10:19,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2110 transitions. [2025-03-04 00:10:19,206 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2110 transitions. Word has length 299 [2025-03-04 00:10:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 2110 transitions. [2025-03-04 00:10:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:10:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2025-03-04 00:10:19,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:10:19,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:19,210 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:19,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:10:19,211 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:19,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:19,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2054758076, now seen corresponding path program 1 times [2025-03-04 00:10:19,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:19,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871529538] [2025-03-04 00:10:19,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:19,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:19,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:10:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:10:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:19,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871529538] [2025-03-04 00:10:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871529538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:10:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871655429] [2025-03-04 00:10:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:10:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:20,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:10:20,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:10:20,736 INFO L87 Difference]: Start difference. First operand 1415 states and 2110 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:10:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:22,491 INFO L93 Difference]: Finished difference Result 3689 states and 5439 transitions. [2025-03-04 00:10:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:10:22,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 299 [2025-03-04 00:10:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:22,505 INFO L225 Difference]: With dead ends: 3689 [2025-03-04 00:10:22,505 INFO L226 Difference]: Without dead ends: 2913 [2025-03-04 00:10:22,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:10:22,510 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1343 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:22,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2313 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:10:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2025-03-04 00:10:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2263. [2025-03-04 00:10:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1876 states have (on average 1.415778251599147) internal successors, (2656), 1897 states have internal predecessors, (2656), 335 states have call successors, (335), 51 states have call predecessors, (335), 51 states have return successors, (335), 314 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-04 00:10:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3326 transitions. [2025-03-04 00:10:22,744 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3326 transitions. Word has length 299 [2025-03-04 00:10:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:22,745 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3326 transitions. [2025-03-04 00:10:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-03-04 00:10:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3326 transitions. [2025-03-04 00:10:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-04 00:10:22,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:22,749 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:22,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:10:22,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:22,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2046998717, now seen corresponding path program 1 times [2025-03-04 00:10:22,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:22,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659720523] [2025-03-04 00:10:22,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:22,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:22,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-04 00:10:22,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-04 00:10:22,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:22,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:23,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:23,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:23,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659720523] [2025-03-04 00:10:23,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659720523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:23,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:23,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:10:23,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368218632] [2025-03-04 00:10:23,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:23,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:10:23,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:23,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:10:23,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:10:23,728 INFO L87 Difference]: Start difference. First operand 2263 states and 3326 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:10:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:25,706 INFO L93 Difference]: Finished difference Result 3125 states and 4591 transitions. [2025-03-04 00:10:25,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:10:25,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-03-04 00:10:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:25,718 INFO L225 Difference]: With dead ends: 3125 [2025-03-04 00:10:25,718 INFO L226 Difference]: Without dead ends: 2398 [2025-03-04 00:10:25,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:10:25,721 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 748 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:25,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2246 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:10:25,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-04 00:10:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2183. [2025-03-04 00:10:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1796 states have (on average 1.4053452115812917) internal successors, (2524), 1817 states have internal predecessors, (2524), 335 states have call successors, (335), 51 states have call predecessors, (335), 51 states have return successors, (335), 314 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-04 00:10:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3194 transitions. [2025-03-04 00:10:25,948 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3194 transitions. Word has length 299 [2025-03-04 00:10:25,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:25,950 INFO L471 AbstractCegarLoop]: Abstraction has 2183 states and 3194 transitions. [2025-03-04 00:10:25,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-03-04 00:10:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3194 transitions. [2025-03-04 00:10:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:10:25,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:25,954 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:25,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 00:10:25,954 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:25,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:25,955 INFO L85 PathProgramCache]: Analyzing trace with hash -965435127, now seen corresponding path program 1 times [2025-03-04 00:10:25,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:25,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789318186] [2025-03-04 00:10:25,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:25,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:25,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:10:26,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:10:26,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:26,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:44,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:44,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789318186] [2025-03-04 00:10:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789318186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:10:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175917644] [2025-03-04 00:10:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:44,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:10:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:44,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:10:44,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:10:44,737 INFO L87 Difference]: Start difference. First operand 2183 states and 3194 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:10:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:10:46,608 INFO L93 Difference]: Finished difference Result 3186 states and 4708 transitions. [2025-03-04 00:10:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:10:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 300 [2025-03-04 00:10:46,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:10:46,618 INFO L225 Difference]: With dead ends: 3186 [2025-03-04 00:10:46,618 INFO L226 Difference]: Without dead ends: 2797 [2025-03-04 00:10:46,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:10:46,620 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 1421 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:10:46,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1375 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 00:10:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2025-03-04 00:10:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2525. [2025-03-04 00:10:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2525 states, 2083 states have (on average 1.4109457513202113) internal successors, (2939), 2106 states have internal predecessors, (2939), 385 states have call successors, (385), 56 states have call predecessors, (385), 56 states have return successors, (385), 362 states have call predecessors, (385), 385 states have call successors, (385) [2025-03-04 00:10:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2525 states to 2525 states and 3709 transitions. [2025-03-04 00:10:46,845 INFO L78 Accepts]: Start accepts. Automaton has 2525 states and 3709 transitions. Word has length 300 [2025-03-04 00:10:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:10:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 2525 states and 3709 transitions. [2025-03-04 00:10:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-03-04 00:10:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2525 states and 3709 transitions. [2025-03-04 00:10:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-04 00:10:46,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:10:46,850 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:10:46,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:10:46,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:10:46,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:10:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash -527425624, now seen corresponding path program 1 times [2025-03-04 00:10:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:10:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997256068] [2025-03-04 00:10:46,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:10:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:10:46,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-04 00:10:46,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-04 00:10:46,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:10:46,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:10:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-03-04 00:10:47,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:10:47,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997256068] [2025-03-04 00:10:47,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997256068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:10:47,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:10:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:10:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953232034] [2025-03-04 00:10:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:10:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:10:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:10:47,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:10:47,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:10:47,672 INFO L87 Difference]: Start difference. First operand 2525 states and 3709 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43)