./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label10.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ea5326ea6a4625baef91f26404c87dc5d5aed789a046625372b5a13e975410bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:05:48,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:05:48,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:05:48,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:05:48,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:05:48,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:05:48,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:05:48,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:05:48,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:05:48,582 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:05:48,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:05:48,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:05:48,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:05:48,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:05:48,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:05:48,584 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:48,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:48,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:48,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:05:48,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:05:48,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:05:48,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:05:48,586 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-jdk21/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 -> ea5326ea6a4625baef91f26404c87dc5d5aed789a046625372b5a13e975410bc [2025-01-09 00:05:48,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:05:48,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:05:48,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:05:48,853 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:05:48,853 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:05:48,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label10.c [2025-01-09 00:05:50,048 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bbb83a98/0245c20694c04cebb387d23ef1dd3157/FLAGe2de0e544 [2025-01-09 00:05:50,376 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:05:50,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c [2025-01-09 00:05:50,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bbb83a98/0245c20694c04cebb387d23ef1dd3157/FLAGe2de0e544 [2025-01-09 00:05:50,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5bbb83a98/0245c20694c04cebb387d23ef1dd3157 [2025-01-09 00:05:50,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:05:50,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:05:50,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:50,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:05:50,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:05:50,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:50" (1/1) ... [2025-01-09 00:05:50,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec99e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:50, skipping insertion in model container [2025-01-09 00:05:50,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:05:50" (1/1) ... [2025-01-09 00:05:50,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:05:50,766 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c[3517,3530] [2025-01-09 00:05:50,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:50,995 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:05:51,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label10.c[3517,3530] [2025-01-09 00:05:51,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:05:51,127 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:05:51,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51 WrapperNode [2025-01-09 00:05:51,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:05:51,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:51,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:05:51,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:05:51,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,298 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:05:51,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:05:51,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:05:51,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:05:51,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:05:51,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,466 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-01-09 00:05:51,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,544 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:05:51,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:05:51,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:05:51,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:05:51,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (1/1) ... [2025-01-09 00:05:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:05:51,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:05:51,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:05:51,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:05:51,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:05:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:05:51,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:05:51,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:05:51,777 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:05:51,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:05:53,367 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:05:53,367 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:05:53,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:05:53,384 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:05:53,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:53 BoogieIcfgContainer [2025-01-09 00:05:53,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:05:53,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:05:53,386 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:05:53,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:05:53,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:05:50" (1/3) ... [2025-01-09 00:05:53,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c68acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:53, skipping insertion in model container [2025-01-09 00:05:53,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:05:51" (2/3) ... [2025-01-09 00:05:53,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c68acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:05:53, skipping insertion in model container [2025-01-09 00:05:53,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:53" (3/3) ... [2025-01-09 00:05:53,391 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label10.c [2025-01-09 00:05:53,401 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:05:53,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label10.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:05:53,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:05:53,451 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;@44033e94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:05:53,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:05:53,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 00:05:53,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:53,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:53,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:53,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash 771715890, now seen corresponding path program 1 times [2025-01-09 00:05:53,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:53,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863582309] [2025-01-09 00:05:53,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:53,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:53,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 00:05:53,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 00:05:53,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:53,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:05:53,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:53,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863582309] [2025-01-09 00:05:53,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863582309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:53,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:53,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:05:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485775356] [2025-01-09 00:05:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:53,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:05:53,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:53,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:05:53,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:05:53,749 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:56,141 INFO L93 Difference]: Finished difference Result 1456 states and 2760 transitions. [2025-01-09 00:05:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:05:56,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 00:05:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:56,166 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 00:05:56,167 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 00:05:56,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:05:56,175 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 968 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:56,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 347 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 00:05:56,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 00:05:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 00:05:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.4858585858585858) internal successors, (1471), 990 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1471 transitions. [2025-01-09 00:05:56,264 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1471 transitions. Word has length 32 [2025-01-09 00:05:56,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:56,269 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1471 transitions. [2025-01-09 00:05:56,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1471 transitions. [2025-01-09 00:05:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 00:05:56,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:56,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:05:56,272 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2058156612, now seen corresponding path program 1 times [2025-01-09 00:05:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472451308] [2025-01-09 00:05:56,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:56,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 00:05:56,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 00:05:56,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:56,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 00:05:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:56,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472451308] [2025-01-09 00:05:56,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472451308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:56,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:56,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233000566] [2025-01-09 00:05:56,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:56,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:56,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:56,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:56,493 INFO L87 Difference]: Start difference. First operand 991 states and 1471 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:57,532 INFO L93 Difference]: Finished difference Result 2309 states and 3726 transitions. [2025-01-09 00:05:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:57,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-01-09 00:05:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:57,538 INFO L225 Difference]: With dead ends: 2309 [2025-01-09 00:05:57,538 INFO L226 Difference]: Without dead ends: 1649 [2025-01-09 00:05:57,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:57,539 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 280 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:57,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 199 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:05:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-01-09 00:05:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-01-09 00:05:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.379247572815534) internal successors, (2273), 1648 states have internal predecessors, (2273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:57,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2273 transitions. [2025-01-09 00:05:57,562 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2273 transitions. Word has length 119 [2025-01-09 00:05:57,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:57,563 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2273 transitions. [2025-01-09 00:05:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2273 transitions. [2025-01-09 00:05:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-09 00:05:57,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:57,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:57,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:05:57,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:57,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:57,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2078599558, now seen corresponding path program 1 times [2025-01-09 00:05:57,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:57,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033310609] [2025-01-09 00:05:57,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:57,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:57,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 00:05:57,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 00:05:57,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:57,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:05:57,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:57,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033310609] [2025-01-09 00:05:57,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033310609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:57,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:57,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:57,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232639434] [2025-01-09 00:05:57,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:57,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:57,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:57,809 INFO L87 Difference]: Start difference. First operand 1649 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:05:58,839 INFO L93 Difference]: Finished difference Result 4283 states and 6132 transitions. [2025-01-09 00:05:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:05:58,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-01-09 00:05:58,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:05:58,848 INFO L225 Difference]: With dead ends: 4283 [2025-01-09 00:05:58,848 INFO L226 Difference]: Without dead ends: 2965 [2025-01-09 00:05:58,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:58,849 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:05:58,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:05:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-01-09 00:05:58,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2636. [2025-01-09 00:05:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3400379506641367) internal successors, (3531), 2635 states have internal predecessors, (3531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3531 transitions. [2025-01-09 00:05:58,879 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3531 transitions. Word has length 198 [2025-01-09 00:05:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:05:58,879 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3531 transitions. [2025-01-09 00:05:58,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:05:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3531 transitions. [2025-01-09 00:05:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-09 00:05:58,882 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:05:58,882 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:05:58,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:05:58,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:05:58,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:05:58,883 INFO L85 PathProgramCache]: Analyzing trace with hash 720184484, now seen corresponding path program 1 times [2025-01-09 00:05:58,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:05:58,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755706603] [2025-01-09 00:05:58,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:05:58,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:05:58,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 00:05:58,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 00:05:58,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:05:58,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:05:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 00:05:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:05:59,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755706603] [2025-01-09 00:05:59,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755706603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:05:59,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:05:59,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:05:59,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77796748] [2025-01-09 00:05:59,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:05:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:05:59,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:05:59,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:05:59,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:05:59,085 INFO L87 Difference]: Start difference. First operand 2636 states and 3531 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:00,049 INFO L93 Difference]: Finished difference Result 5599 states and 7527 transitions. [2025-01-09 00:06:00,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:00,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2025-01-09 00:06:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:00,059 INFO L225 Difference]: With dead ends: 5599 [2025-01-09 00:06:00,059 INFO L226 Difference]: Without dead ends: 3294 [2025-01-09 00:06:00,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:00,062 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:00,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-01-09 00:06:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2025-01-09 00:06:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2247191011235956) internal successors, (4033), 3293 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4033 transitions. [2025-01-09 00:06:00,113 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4033 transitions. Word has length 274 [2025-01-09 00:06:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:00,114 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4033 transitions. [2025-01-09 00:06:00,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4033 transitions. [2025-01-09 00:06:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-09 00:06:00,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:00,121 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:00,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:06:00,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:00,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash 906485811, now seen corresponding path program 1 times [2025-01-09 00:06:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:00,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496543622] [2025-01-09 00:06:00,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:00,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:00,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-09 00:06:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-09 00:06:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-01-09 00:06:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:00,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496543622] [2025-01-09 00:06:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496543622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:00,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737895087] [2025-01-09 00:06:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:00,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:00,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:00,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:00,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:00,414 INFO L87 Difference]: Start difference. First operand 3294 states and 4033 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:01,342 INFO L93 Difference]: Finished difference Result 6586 states and 8076 transitions. [2025-01-09 00:06:01,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:01,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2025-01-09 00:06:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:01,349 INFO L225 Difference]: With dead ends: 6586 [2025-01-09 00:06:01,349 INFO L226 Difference]: Without dead ends: 3294 [2025-01-09 00:06:01,351 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-01-09 00:06:01,352 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 288 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:01,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 538 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-01-09 00:06:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2025-01-09 00:06:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.0567871242028546) internal successors, (3480), 3293 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3480 transitions. [2025-01-09 00:06:01,384 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3480 transitions. Word has length 451 [2025-01-09 00:06:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:01,385 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 3480 transitions. [2025-01-09 00:06:01,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3480 transitions. [2025-01-09 00:06:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-01-09 00:06:01,390 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:01,390 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:06:01,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:06:01,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:01,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:01,391 INFO L85 PathProgramCache]: Analyzing trace with hash 825982573, now seen corresponding path program 1 times [2025-01-09 00:06:01,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:01,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323749952] [2025-01-09 00:06:01,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:01,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:01,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-01-09 00:06:01,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-01-09 00:06:01,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:01,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-09 00:06:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323749952] [2025-01-09 00:06:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323749952] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350458927] [2025-01-09 00:06:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:01,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:01,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:01,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:01,737 INFO L87 Difference]: Start difference. First operand 3294 states and 3480 transitions. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:02,491 INFO L93 Difference]: Finished difference Result 7902 states and 8408 transitions. [2025-01-09 00:06:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 503 [2025-01-09 00:06:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:02,502 INFO L225 Difference]: With dead ends: 7902 [2025-01-09 00:06:02,503 INFO L226 Difference]: Without dead ends: 4939 [2025-01-09 00:06:02,505 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-01-09 00:06:02,506 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:02,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 432 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-01-09 00:06:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4610. [2025-01-09 00:06:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.046213929268822) internal successors, (4822), 4609 states have internal predecessors, (4822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4822 transitions. [2025-01-09 00:06:02,561 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4822 transitions. Word has length 503 [2025-01-09 00:06:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:02,562 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4822 transitions. [2025-01-09 00:06:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4822 transitions. [2025-01-09 00:06:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-01-09 00:06:02,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:02,569 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:02,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:06:02,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:02,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:02,570 INFO L85 PathProgramCache]: Analyzing trace with hash -571141054, now seen corresponding path program 1 times [2025-01-09 00:06:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289183919] [2025-01-09 00:06:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:02,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:02,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-01-09 00:06:02,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-01-09 00:06:02,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 00:06:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289183919] [2025-01-09 00:06:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289183919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:02,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408461736] [2025-01-09 00:06:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:02,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:02,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:02,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:02,944 INFO L87 Difference]: Start difference. First operand 4610 states and 4822 transitions. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:03,632 INFO L93 Difference]: Finished difference Result 10534 states and 11092 transitions. [2025-01-09 00:06:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 537 [2025-01-09 00:06:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:03,644 INFO L225 Difference]: With dead ends: 10534 [2025-01-09 00:06:03,644 INFO L226 Difference]: Without dead ends: 5926 [2025-01-09 00:06:03,648 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-01-09 00:06:03,649 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 176 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:03,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 419 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2025-01-09 00:06:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2025-01-09 00:06:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5926 states, 5925 states have (on average 1.0413502109704642) internal successors, (6170), 5925 states have internal predecessors, (6170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 6170 transitions. [2025-01-09 00:06:03,713 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 6170 transitions. Word has length 537 [2025-01-09 00:06:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:03,714 INFO L471 AbstractCegarLoop]: Abstraction has 5926 states and 6170 transitions. [2025-01-09 00:06:03,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 6170 transitions. [2025-01-09 00:06:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-01-09 00:06:03,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:03,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:06:03,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:03,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1403601946, now seen corresponding path program 1 times [2025-01-09 00:06:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88938726] [2025-01-09 00:06:03,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:03,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-01-09 00:06:03,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-01-09 00:06:03,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:03,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-01-09 00:06:04,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:04,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88938726] [2025-01-09 00:06:04,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88938726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:04,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:04,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:04,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408991622] [2025-01-09 00:06:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:04,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:04,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:04,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:04,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:04,193 INFO L87 Difference]: Start difference. First operand 5926 states and 6170 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:04,933 INFO L93 Difference]: Finished difference Result 13166 states and 13784 transitions. [2025-01-09 00:06:04,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:04,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 696 [2025-01-09 00:06:04,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:04,949 INFO L225 Difference]: With dead ends: 13166 [2025-01-09 00:06:04,949 INFO L226 Difference]: Without dead ends: 7242 [2025-01-09 00:06:04,954 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-01-09 00:06:04,955 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:04,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 435 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2025-01-09 00:06:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 7242. [2025-01-09 00:06:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.0367352575611104) internal successors, (7507), 7241 states have internal predecessors, (7507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:05,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7507 transitions. [2025-01-09 00:06:05,028 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7507 transitions. Word has length 696 [2025-01-09 00:06:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 7507 transitions. [2025-01-09 00:06:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7507 transitions. [2025-01-09 00:06:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 698 [2025-01-09 00:06:05,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:05,034 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:05,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:06:05,035 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:05,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -906200826, now seen corresponding path program 1 times [2025-01-09 00:06:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66032258] [2025-01-09 00:06:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:05,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-01-09 00:06:05,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-01-09 00:06:05,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:05,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 90 proven. 446 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-01-09 00:06:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66032258] [2025-01-09 00:06:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66032258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:06:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237195605] [2025-01-09 00:06:05,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:05,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:05,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:06:05,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:06:05,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 697 statements into 1 equivalence classes. [2025-01-09 00:06:05,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 697 of 697 statements. [2025-01-09 00:06:05,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:05,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:05,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:06:05,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:06:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 00:06:06,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:06:06,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237195605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:06,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:06:06,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:06:06,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565025062] [2025-01-09 00:06:06,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:06,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:06,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:06,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:06,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:06,096 INFO L87 Difference]: Start difference. First operand 7242 states and 7507 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:06,741 INFO L93 Difference]: Finished difference Result 14153 states and 14681 transitions. [2025-01-09 00:06:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:06,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 697 [2025-01-09 00:06:06,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:06,759 INFO L225 Difference]: With dead ends: 14153 [2025-01-09 00:06:06,759 INFO L226 Difference]: Without dead ends: 7242 [2025-01-09 00:06:06,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:06:06,764 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 335 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:06,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 377 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:06:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7242 states. [2025-01-09 00:06:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 7242. [2025-01-09 00:06:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.0321778759839801) internal successors, (7474), 7241 states have internal predecessors, (7474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:06,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7474 transitions. [2025-01-09 00:06:06,826 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7474 transitions. Word has length 697 [2025-01-09 00:06:06,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:06,827 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 7474 transitions. [2025-01-09 00:06:06,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7474 transitions. [2025-01-09 00:06:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2025-01-09 00:06:06,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:06,839 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:06,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:06:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:06:07,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1393173203, now seen corresponding path program 1 times [2025-01-09 00:06:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439619225] [2025-01-09 00:06:07,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:07,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-01-09 00:06:07,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-01-09 00:06:07,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:07,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2029 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-01-09 00:06:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:08,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439619225] [2025-01-09 00:06:08,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439619225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:08,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:06:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305684439] [2025-01-09 00:06:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:06:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:06:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:06:08,211 INFO L87 Difference]: Start difference. First operand 7242 states and 7474 transitions. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:09,195 INFO L93 Difference]: Finished difference Result 14161 states and 14623 transitions. [2025-01-09 00:06:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:06:09,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1125 [2025-01-09 00:06:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:09,212 INFO L225 Difference]: With dead ends: 14161 [2025-01-09 00:06:09,212 INFO L226 Difference]: Without dead ends: 7250 [2025-01-09 00:06:09,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:06:09,226 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:09,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 447 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:06:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7250 states. [2025-01-09 00:06:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7250 to 7242. [2025-01-09 00:06:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.0319016710399116) internal successors, (7472), 7241 states have internal predecessors, (7472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7472 transitions. [2025-01-09 00:06:09,341 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7472 transitions. Word has length 1125 [2025-01-09 00:06:09,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:09,341 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 7472 transitions. [2025-01-09 00:06:09,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7472 transitions. [2025-01-09 00:06:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1296 [2025-01-09 00:06:09,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:09,366 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:06:09,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:09,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:09,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1265980820, now seen corresponding path program 1 times [2025-01-09 00:06:09,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:09,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092413252] [2025-01-09 00:06:09,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:09,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:09,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1295 statements into 1 equivalence classes. [2025-01-09 00:06:09,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1295 of 1295 statements. [2025-01-09 00:06:09,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:09,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3017 backedges. 965 proven. 0 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-01-09 00:06:10,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:10,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092413252] [2025-01-09 00:06:10,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092413252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:10,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:10,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:10,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148594786] [2025-01-09 00:06:10,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:10,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:10,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:10,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:10,362 INFO L87 Difference]: Start difference. First operand 7242 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:11,065 INFO L93 Difference]: Finished difference Result 16127 states and 16647 transitions. [2025-01-09 00:06:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:11,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1295 [2025-01-09 00:06:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:11,086 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:06:11,086 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 00:06:11,096 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-01-09 00:06:11,101 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 196 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:11,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 414 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 00:06:11,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-01-09 00:06:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0272186352702875) internal successors, (8114), 7899 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8114 transitions. [2025-01-09 00:06:11,156 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8114 transitions. Word has length 1295 [2025-01-09 00:06:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:11,157 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8114 transitions. [2025-01-09 00:06:11,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8114 transitions. [2025-01-09 00:06:11,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1326 [2025-01-09 00:06:11,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:11,170 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:11,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:06:11,171 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:11,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1552880535, now seen corresponding path program 1 times [2025-01-09 00:06:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:11,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663545201] [2025-01-09 00:06:11,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1325 statements into 1 equivalence classes. [2025-01-09 00:06:11,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1325 of 1325 statements. [2025-01-09 00:06:11,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:11,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3673 backedges. 2275 proven. 0 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2025-01-09 00:06:12,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:12,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663545201] [2025-01-09 00:06:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663545201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235147542] [2025-01-09 00:06:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:12,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:12,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:12,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:12,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:12,180 INFO L87 Difference]: Start difference. First operand 7900 states and 8114 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:12,961 INFO L93 Difference]: Finished difference Result 16456 states and 16897 transitions. [2025-01-09 00:06:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:12,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1325 [2025-01-09 00:06:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:12,974 INFO L225 Difference]: With dead ends: 16456 [2025-01-09 00:06:12,974 INFO L226 Difference]: Without dead ends: 8887 [2025-01-09 00:06:12,981 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-01-09 00:06:12,982 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:12,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 434 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:12,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-01-09 00:06:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-01-09 00:06:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.024983119513842) internal successors, (9108), 8886 states have internal predecessors, (9108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9108 transitions. [2025-01-09 00:06:13,085 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9108 transitions. Word has length 1325 [2025-01-09 00:06:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:13,086 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9108 transitions. [2025-01-09 00:06:13,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9108 transitions. [2025-01-09 00:06:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2025-01-09 00:06:13,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:13,111 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:13,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:06:13,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:13,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1627066946, now seen corresponding path program 1 times [2025-01-09 00:06:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464963580] [2025-01-09 00:06:13,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1343 statements into 1 equivalence classes. [2025-01-09 00:06:13,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1343 of 1343 statements. [2025-01-09 00:06:13,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:13,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3682 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-01-09 00:06:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464963580] [2025-01-09 00:06:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464963580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:13,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334011059] [2025-01-09 00:06:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:13,869 INFO L87 Difference]: Start difference. First operand 8887 states and 9108 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:14,250 INFO L93 Difference]: Finished difference Result 9223 states and 9444 transitions. [2025-01-09 00:06:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:14,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1343 [2025-01-09 00:06:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:14,260 INFO L225 Difference]: With dead ends: 9223 [2025-01-09 00:06:14,260 INFO L226 Difference]: Without dead ends: 8887 [2025-01-09 00:06:14,262 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-01-09 00:06:14,262 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:14,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 00:06:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-01-09 00:06:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-01-09 00:06:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0248705829394553) internal successors, (9107), 8886 states have internal predecessors, (9107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9107 transitions. [2025-01-09 00:06:14,318 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9107 transitions. Word has length 1343 [2025-01-09 00:06:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:14,318 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9107 transitions. [2025-01-09 00:06:14,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9107 transitions. [2025-01-09 00:06:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-01-09 00:06:14,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:14,336 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:14,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:06:14,336 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:14,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1792408641, now seen corresponding path program 1 times [2025-01-09 00:06:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:14,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709938670] [2025-01-09 00:06:14,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:14,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-01-09 00:06:14,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-01-09 00:06:14,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:14,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3985 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 3746 trivial. 0 not checked. [2025-01-09 00:06:15,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:15,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709938670] [2025-01-09 00:06:15,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709938670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:15,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:15,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156127777] [2025-01-09 00:06:15,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:15,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:15,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:15,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:15,081 INFO L87 Difference]: Start difference. First operand 8887 states and 9107 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:15,848 INFO L93 Difference]: Finished difference Result 23034 states and 23636 transitions. [2025-01-09 00:06:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:15,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1495 [2025-01-09 00:06:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:15,850 INFO L225 Difference]: With dead ends: 23034 [2025-01-09 00:06:15,850 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:06:15,860 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-01-09 00:06:15,861 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 304 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:15,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 47 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:06:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:06:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:06:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:06:15,862 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1495 [2025-01-09 00:06:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:15,862 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:06:15,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:15,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:06:15,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:06:15,864 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:06:15,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:06:15,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:15,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:06:16,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:06:16,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:06:16 BoogieIcfgContainer [2025-01-09 00:06:16,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:06:16,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:06:16,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:06:16,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:06:16,242 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:05:53" (3/4) ... [2025-01-09 00:06:16,244 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:06:16,269 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:06:16,271 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:06:16,272 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:06:16,273 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:06:16,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:06:16,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:06:16,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:06:16,400 INFO L158 Benchmark]: Toolchain (without parser) took 25780.45ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.4MB in the beginning and 764.2MB in the end (delta: -644.8MB). Peak memory consumption was 474.8MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,400 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:06:16,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.23ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 62.9MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 173.74ms. Allocated memory is still 167.8MB. Free memory was 62.9MB in the beginning and 39.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,400 INFO L158 Benchmark]: Boogie Preprocessor took 371.09ms. Allocated memory is still 167.8MB. Free memory was 39.3MB in the beginning and 79.2MB in the end (delta: -39.9MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,400 INFO L158 Benchmark]: RCFGBuilder took 1709.61ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.2MB in the beginning and 254.6MB in the end (delta: -175.3MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,401 INFO L158 Benchmark]: TraceAbstraction took 22854.33ms. Allocated memory was 385.9MB in the beginning and 1.3GB in the end (delta: 897.6MB). Free memory was 254.6MB in the beginning and 789.1MB in the end (delta: -534.5MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,401 INFO L158 Benchmark]: Witness Printer took 157.97ms. Allocated memory is still 1.3GB. Free memory was 789.1MB in the beginning and 764.2MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:06:16,402 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.23ms. Allocated memory is still 167.8MB. Free memory was 119.4MB in the beginning and 62.9MB in the end (delta: 56.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 173.74ms. Allocated memory is still 167.8MB. Free memory was 62.9MB in the beginning and 39.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 371.09ms. Allocated memory is still 167.8MB. Free memory was 39.3MB in the beginning and 79.2MB in the end (delta: -39.9MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1709.61ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 79.2MB in the beginning and 254.6MB in the end (delta: -175.3MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22854.33ms. Allocated memory was 385.9MB in the beginning and 1.3GB in the end (delta: 897.6MB). Free memory was 254.6MB in the beginning and 789.1MB in the end (delta: -534.5MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. * Witness Printer took 157.97ms. Allocated memory is still 1.3GB. Free memory was 789.1MB in the beginning and 764.2MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 113]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.4s, OverallIterations: 14, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4065 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4065 mSDsluCounter, 4755 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 2275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12844 IncrementalHoareTripleChecker+Invalid, 15119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2275 mSolverCounterUnsat, 4655 mSDtfsCounter, 12844 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 741 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8887occurred in iteration=12, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 666 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 10787 NumberOfCodeBlocks, 10787 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 10772 ConstructedInterpolants, 0 QuantifiedInterpolants, 19764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 839 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 20191/20637 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: (((((((((((a16 == 9) && (7 == a12)) || ((a15 <= 3) && (a16 != 8))) || ((a12 == 6) && (a16 <= 11))) || ((((long long) 76 + a18) <= 0) && (a16 == 9))) || ((((long long) 76 + a18) <= 0) && (a15 <= 3))) || ((a16 == 9) && (a12 == 8))) || ((a16 <= 8) && (4 <= a15))) || ((a15 <= 3) && (a12 == 8))) || (((a12 == 9) && (135 <= a18)) && (a15 == 3))) || ((a12 <= 5) && (a16 <= 11))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:06:16,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE