./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label23.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/Problem10_label23.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 f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:39:39,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:39:39,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:39:39,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:39:39,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:39:39,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:39:39,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:39:39,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:39:39,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:39:39,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:39:39,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:39:39,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:39:39,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:39:39,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:39:39,414 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:39:39,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:39:39,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:39:39,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:39:39,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:39:39,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:39:39,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:39,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:39,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:39,416 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:39:39,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:39:39,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:39:39,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:39:39,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:39,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:39:39,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:39:39,417 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 -> f668bcf95cb3f7c5766f9dcc6b0650136e6fca9e506098f3960957e6cecfca84 [2025-01-08 23:39:39,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:39:39,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:39:39,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:39:39,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:39:39,662 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:39:39,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2025-01-08 23:39:40,867 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bd28b5/849fc6bd21d744f18dde6bd3118f6ebe/FLAG17ddb43bc [2025-01-08 23:39:41,144 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:39:41,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label23.c [2025-01-08 23:39:41,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bd28b5/849fc6bd21d744f18dde6bd3118f6ebe/FLAG17ddb43bc [2025-01-08 23:39:41,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/248bd28b5/849fc6bd21d744f18dde6bd3118f6ebe [2025-01-08 23:39:41,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:39:41,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:39:41,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:41,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:39:41,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:39:41,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b65ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41, skipping insertion in model container [2025-01-08 23:39:41,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:39:41,581 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/Problem10_label23.c[5328,5341] [2025-01-08 23:39:41,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:41,656 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:39:41,670 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/Problem10_label23.c[5328,5341] [2025-01-08 23:39:41,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:39:41,727 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:39:41,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41 WrapperNode [2025-01-08 23:39:41,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:39:41,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:41,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:39:41,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:39:41,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,779 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:39:41,780 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:39:41,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:39:41,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:39:41,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:39:41,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,795 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,811 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-08 23:39:41,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:39:41,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:39:41,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:39:41,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:39:41,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (1/1) ... [2025-01-08 23:39:41,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:39:41,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:41,899 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-08 23:39:41,906 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-08 23:39:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:39:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:39:41,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:39:41,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:39:41,984 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:39:41,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:39:42,759 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:39:42,759 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:39:42,767 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:39:42,768 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:39:42,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:42 BoogieIcfgContainer [2025-01-08 23:39:42,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:39:42,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:39:42,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:39:42,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:39:42,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:39:41" (1/3) ... [2025-01-08 23:39:42,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef122fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:42, skipping insertion in model container [2025-01-08 23:39:42,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:39:41" (2/3) ... [2025-01-08 23:39:42,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef122fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:39:42, skipping insertion in model container [2025-01-08 23:39:42,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:42" (3/3) ... [2025-01-08 23:39:42,777 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label23.c [2025-01-08 23:39:42,786 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:39:42,787 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label23.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:39:42,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:39:42,846 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;@5c1df92d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:39:42,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:39:42,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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-08 23:39:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-08 23:39:42,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:42,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:42,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:42,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:42,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2006201642, now seen corresponding path program 1 times [2025-01-08 23:39:42,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:42,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018689472] [2025-01-08 23:39:42,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:42,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:42,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-08 23:39:42,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-08 23:39:42,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:42,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:43,174 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-08 23:39:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018689472] [2025-01-08 23:39:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018689472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:43,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643344984] [2025-01-08 23:39:43,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:43,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:43,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:43,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:43,200 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-08 23:39:43,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:43,862 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-01-08 23:39:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2025-01-08 23:39:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:43,870 INFO L225 Difference]: With dead ends: 567 [2025-01-08 23:39:43,871 INFO L226 Difference]: Without dead ends: 282 [2025-01-08 23:39:43,873 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-08 23:39:43,875 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:43,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 32 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:39:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-08 23:39:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-01-08 23:39:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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-08 23:39:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2025-01-08 23:39:43,906 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 46 [2025-01-08 23:39:43,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:43,906 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2025-01-08 23:39:43,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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-08 23:39:43,906 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2025-01-08 23:39:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 23:39:43,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:43,908 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, 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] [2025-01-08 23:39:43,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:39:43,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1266557622, now seen corresponding path program 1 times [2025-01-08 23:39:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:43,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178031353] [2025-01-08 23:39:43,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 23:39:43,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 23:39:43,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:43,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178031353] [2025-01-08 23:39:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178031353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307038502] [2025-01-08 23:39:44,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:44,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:44,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:44,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:44,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:44,070 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:44,447 INFO L93 Difference]: Finished difference Result 840 states and 1291 transitions. [2025-01-08 23:39:44,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:44,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-08 23:39:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:44,450 INFO L225 Difference]: With dead ends: 840 [2025-01-08 23:39:44,450 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:39:44,451 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-08 23:39:44,452 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 96 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:44,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 226 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:44,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:39:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:39:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 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-08 23:39:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2025-01-08 23:39:44,471 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 112 [2025-01-08 23:39:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:44,471 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2025-01-08 23:39:44,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:39:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2025-01-08 23:39:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 23:39:44,476 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:44,477 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, 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] [2025-01-08 23:39:44,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:39:44,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -96077596, now seen corresponding path program 1 times [2025-01-08 23:39:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:44,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705249960] [2025-01-08 23:39:44,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:44,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:44,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 23:39:44,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 23:39:44,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:44,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705249960] [2025-01-08 23:39:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705249960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:44,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877255176] [2025-01-08 23:39:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:44,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:44,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:44,668 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-08 23:39:45,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:45,027 INFO L93 Difference]: Finished difference Result 1257 states and 1672 transitions. [2025-01-08 23:39:45,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:45,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-08 23:39:45,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:45,030 INFO L225 Difference]: With dead ends: 1257 [2025-01-08 23:39:45,030 INFO L226 Difference]: Without dead ends: 699 [2025-01-08 23:39:45,031 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-08 23:39:45,032 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:45,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-08 23:39:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-01-08 23:39:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2951289398280803) internal successors, (904), 698 states have internal predecessors, (904), 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-08 23:39:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 904 transitions. [2025-01-08 23:39:45,049 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 904 transitions. Word has length 119 [2025-01-08 23:39:45,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:45,049 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 904 transitions. [2025-01-08 23:39:45,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-08 23:39:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 904 transitions. [2025-01-08 23:39:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 23:39:45,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:45,051 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, 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] [2025-01-08 23:39:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:39:45,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -226284390, now seen corresponding path program 1 times [2025-01-08 23:39:45,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:45,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676133206] [2025-01-08 23:39:45,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:45,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-08 23:39:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 23:39:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:45,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676133206] [2025-01-08 23:39:45,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676133206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:45,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:45,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:39:45,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685376694] [2025-01-08 23:39:45,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:45,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:45,151 INFO L87 Difference]: Start difference. First operand 699 states and 904 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-08 23:39:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:45,510 INFO L93 Difference]: Finished difference Result 1674 states and 2235 transitions. [2025-01-08 23:39:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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 123 [2025-01-08 23:39:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:45,513 INFO L225 Difference]: With dead ends: 1674 [2025-01-08 23:39:45,513 INFO L226 Difference]: Without dead ends: 977 [2025-01-08 23:39:45,514 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-08 23:39:45,515 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:45,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-08 23:39:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2025-01-08 23:39:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2736389684813754) internal successors, (889), 698 states have internal predecessors, (889), 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-08 23:39:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2025-01-08 23:39:45,527 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 123 [2025-01-08 23:39:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:45,528 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2025-01-08 23:39:45,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 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-08 23:39:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2025-01-08 23:39:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-08 23:39:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:45,530 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:39:45,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1636186351, now seen corresponding path program 1 times [2025-01-08 23:39:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474629980] [2025-01-08 23:39:45,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:45,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-08 23:39:45,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-08 23:39:45,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:45,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:45,863 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474629980] [2025-01-08 23:39:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474629980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:45,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:45,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:39:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785486471] [2025-01-08 23:39:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:45,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:39:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:45,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:39:45,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:45,865 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 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-08 23:39:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:46,268 INFO L93 Difference]: Finished difference Result 1312 states and 1682 transitions. [2025-01-08 23:39:46,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:39:46,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 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 194 [2025-01-08 23:39:46,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:46,271 INFO L225 Difference]: With dead ends: 1312 [2025-01-08 23:39:46,271 INFO L226 Difference]: Without dead ends: 699 [2025-01-08 23:39:46,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:46,273 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:46,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-08 23:39:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-01-08 23:39:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2679083094555874) internal successors, (885), 698 states have internal predecessors, (885), 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-08 23:39:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 885 transitions. [2025-01-08 23:39:46,292 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 885 transitions. Word has length 194 [2025-01-08 23:39:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 885 transitions. [2025-01-08 23:39:46,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 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-08 23:39:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2025-01-08 23:39:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 23:39:46,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:46,294 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:46,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:39:46,294 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:46,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2001249267, now seen corresponding path program 1 times [2025-01-08 23:39:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042644663] [2025-01-08 23:39:46,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 23:39:46,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 23:39:46,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-08 23:39:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042644663] [2025-01-08 23:39:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042644663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:46,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:46,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434642366] [2025-01-08 23:39:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:39:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:46,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:39:46,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:39:46,562 INFO L87 Difference]: Start difference. First operand 699 states and 885 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-08 23:39:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:46,963 INFO L93 Difference]: Finished difference Result 1257 states and 1620 transitions. [2025-01-08 23:39:46,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:39:46,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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 206 [2025-01-08 23:39:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:46,965 INFO L225 Difference]: With dead ends: 1257 [2025-01-08 23:39:46,965 INFO L226 Difference]: Without dead ends: 699 [2025-01-08 23:39:46,966 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-08 23:39:46,966 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:46,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 87 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-08 23:39:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-01-08 23:39:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2607449856733524) internal successors, (880), 698 states have internal predecessors, (880), 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-08 23:39:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 880 transitions. [2025-01-08 23:39:46,976 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 880 transitions. Word has length 206 [2025-01-08 23:39:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 880 transitions. [2025-01-08 23:39:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 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-08 23:39:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 880 transitions. [2025-01-08 23:39:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-08 23:39:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:46,979 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:39:46,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:39:46,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:46,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash -640462263, now seen corresponding path program 1 times [2025-01-08 23:39:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188632865] [2025-01-08 23:39:46,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:46,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-08 23:39:47,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-08 23:39:47,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:47,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 23:39:47,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188632865] [2025-01-08 23:39:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188632865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534712818] [2025-01-08 23:39:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:47,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:47,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:47,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:47,240 INFO L87 Difference]: Start difference. First operand 699 states and 880 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 23:39:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:47,604 INFO L93 Difference]: Finished difference Result 1535 states and 2042 transitions. [2025-01-08 23:39:47,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:47,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 230 [2025-01-08 23:39:47,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:47,608 INFO L225 Difference]: With dead ends: 1535 [2025-01-08 23:39:47,608 INFO L226 Difference]: Without dead ends: 977 [2025-01-08 23:39:47,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08 23:39:47,609 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:47,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 71 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:47,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-08 23:39:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2025-01-08 23:39:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2759856630824373) internal successors, (1068), 837 states have internal predecessors, (1068), 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-08 23:39:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1068 transitions. [2025-01-08 23:39:47,622 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1068 transitions. Word has length 230 [2025-01-08 23:39:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:47,623 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1068 transitions. [2025-01-08 23:39:47,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 23:39:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1068 transitions. [2025-01-08 23:39:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 23:39:47,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:47,625 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:39:47,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:39:47,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2132716243, now seen corresponding path program 1 times [2025-01-08 23:39:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983984612] [2025-01-08 23:39:47,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:47,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 23:39:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 23:39:47,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:47,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983984612] [2025-01-08 23:39:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983984612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:47,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:47,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:47,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002515978] [2025-01-08 23:39:47,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:47,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:47,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:47,830 INFO L87 Difference]: Start difference. First operand 838 states and 1068 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-08 23:39:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:48,242 INFO L93 Difference]: Finished difference Result 1535 states and 1991 transitions. [2025-01-08 23:39:48,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:48,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 235 [2025-01-08 23:39:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:48,245 INFO L225 Difference]: With dead ends: 1535 [2025-01-08 23:39:48,245 INFO L226 Difference]: Without dead ends: 838 [2025-01-08 23:39:48,246 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-08 23:39:48,246 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 77 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:48,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 188 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:48,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-08 23:39:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-01-08 23:39:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.1827956989247312) internal successors, (990), 837 states have internal predecessors, (990), 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-08 23:39:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 990 transitions. [2025-01-08 23:39:48,261 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 990 transitions. Word has length 235 [2025-01-08 23:39:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:48,263 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 990 transitions. [2025-01-08 23:39:48,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-08 23:39:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 990 transitions. [2025-01-08 23:39:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-01-08 23:39:48,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:48,265 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, 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, 1, 1, 1, 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-08 23:39:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:39:48,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 767182005, now seen corresponding path program 1 times [2025-01-08 23:39:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:48,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464419214] [2025-01-08 23:39:48,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:48,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:39:48,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:39:48,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:48,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 87 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:39:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464419214] [2025-01-08 23:39:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464419214] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553352787] [2025-01-08 23:39:48,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:48,565 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-08 23:39:48,567 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-08 23:39:48,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-01-08 23:39:48,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-01-08 23:39:48,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:48,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:48,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:48,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:39:48,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:48,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553352787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:48,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:48,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:39:48,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787419132] [2025-01-08 23:39:48,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:48,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:48,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:48,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:48,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:48,907 INFO L87 Difference]: Start difference. First operand 838 states and 990 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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-08 23:39:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:49,541 INFO L93 Difference]: Finished difference Result 1952 states and 2342 transitions. [2025-01-08 23:39:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:49,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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 247 [2025-01-08 23:39:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:49,545 INFO L225 Difference]: With dead ends: 1952 [2025-01-08 23:39:49,545 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:49,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:39:49,547 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:49,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:39:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-01-08 23:39:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.145933014354067) internal successors, (1437), 1254 states have internal predecessors, (1437), 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-08 23:39:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1437 transitions. [2025-01-08 23:39:49,564 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1437 transitions. Word has length 247 [2025-01-08 23:39:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1437 transitions. [2025-01-08 23:39:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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-08 23:39:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1437 transitions. [2025-01-08 23:39:49,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-08 23:39:49,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:49,566 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:49,573 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-08 23:39:49,771 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-08 23:39:49,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:49,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -2123886431, now seen corresponding path program 1 times [2025-01-08 23:39:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697126701] [2025-01-08 23:39:49,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:49,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-08 23:39:49,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-08 23:39:49,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:49,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-08 23:39:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697126701] [2025-01-08 23:39:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697126701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:49,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311112797] [2025-01-08 23:39:49,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:49,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:49,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:49,907 INFO L87 Difference]: Start difference. First operand 1255 states and 1437 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 23:39:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:50,261 INFO L93 Difference]: Finished difference Result 2369 states and 2729 transitions. [2025-01-08 23:39:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 255 [2025-01-08 23:39:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:50,265 INFO L225 Difference]: With dead ends: 2369 [2025-01-08 23:39:50,265 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:50,266 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-08 23:39:50,266 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 102 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:50,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 200 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2025-01-08 23:39:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1103139013452914) internal successors, (1238), 1115 states have internal predecessors, (1238), 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-08 23:39:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1238 transitions. [2025-01-08 23:39:50,281 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1238 transitions. Word has length 255 [2025-01-08 23:39:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:50,281 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1238 transitions. [2025-01-08 23:39:50,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-08 23:39:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1238 transitions. [2025-01-08 23:39:50,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-08 23:39:50,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:50,284 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, 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, 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] [2025-01-08 23:39:50,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:39:50,285 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:50,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:50,285 INFO L85 PathProgramCache]: Analyzing trace with hash 846639095, now seen corresponding path program 1 times [2025-01-08 23:39:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:50,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900993662] [2025-01-08 23:39:50,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:50,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-08 23:39:50,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-08 23:39:50,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:50,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 23:39:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900993662] [2025-01-08 23:39:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900993662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:50,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503374627] [2025-01-08 23:39:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:50,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:50,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:50,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:50,450 INFO L87 Difference]: Start difference. First operand 1116 states and 1238 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-08 23:39:50,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:50,811 INFO L93 Difference]: Finished difference Result 2230 states and 2509 transitions. [2025-01-08 23:39:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:50,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 308 [2025-01-08 23:39:50,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:50,814 INFO L225 Difference]: With dead ends: 2230 [2025-01-08 23:39:50,814 INFO L226 Difference]: Without dead ends: 1255 [2025-01-08 23:39:50,815 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-08 23:39:50,815 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 63 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:50,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-08 23:39:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2025-01-08 23:39:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1100478468899522) internal successors, (1392), 1254 states have internal predecessors, (1392), 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-08 23:39:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1392 transitions. [2025-01-08 23:39:50,830 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1392 transitions. Word has length 308 [2025-01-08 23:39:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1392 transitions. [2025-01-08 23:39:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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-08 23:39:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1392 transitions. [2025-01-08 23:39:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-01-08 23:39:50,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:50,834 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, 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, 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] [2025-01-08 23:39:50,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:39:50,834 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:50,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1054509246, now seen corresponding path program 1 times [2025-01-08 23:39:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788699116] [2025-01-08 23:39:50,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:50,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-01-08 23:39:50,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-01-08 23:39:50,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:50,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-08 23:39:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788699116] [2025-01-08 23:39:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788699116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:50,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:39:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:39:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823829015] [2025-01-08 23:39:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:50,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:50,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:50,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:50,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:39:50,988 INFO L87 Difference]: Start difference. First operand 1255 states and 1392 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:39:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:51,374 INFO L93 Difference]: Finished difference Result 2230 states and 2485 transitions. [2025-01-08 23:39:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:51,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 318 [2025-01-08 23:39:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:51,380 INFO L225 Difference]: With dead ends: 2230 [2025-01-08 23:39:51,380 INFO L226 Difference]: Without dead ends: 2228 [2025-01-08 23:39:51,380 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-08 23:39:51,381 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:51,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 37 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:39:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-01-08 23:39:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1255. [2025-01-08 23:39:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.1100478468899522) internal successors, (1392), 1254 states have internal predecessors, (1392), 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-08 23:39:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1392 transitions. [2025-01-08 23:39:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1392 transitions. Word has length 318 [2025-01-08 23:39:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:51,402 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1392 transitions. [2025-01-08 23:39:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-08 23:39:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1392 transitions. [2025-01-08 23:39:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-08 23:39:51,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:39:51,406 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:39:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:39:51,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:39:51,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:39:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1830568060, now seen corresponding path program 1 times [2025-01-08 23:39:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:39:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495792803] [2025-01-08 23:39:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:51,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:39:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:39:51,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:39:51,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:51,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:51,688 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-01-08 23:39:51,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:39:51,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495792803] [2025-01-08 23:39:51,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495792803] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:39:51,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020339129] [2025-01-08 23:39:51,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:39:51,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:51,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:39:51,690 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:39:51,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:39:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:39:51,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:39:51,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:39:51,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:39:51,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:39:51,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:39:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2025-01-08 23:39:52,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:39:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020339129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:39:52,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:39:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:39:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148036418] [2025-01-08 23:39:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:39:52,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:39:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:39:52,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:39:52,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:39:52,273 INFO L87 Difference]: Start difference. First operand 1255 states and 1392 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-08 23:39:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:39:52,602 INFO L93 Difference]: Finished difference Result 1950 states and 2175 transitions. [2025-01-08 23:39:52,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:39:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 354 [2025-01-08 23:39:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:39:52,620 INFO L225 Difference]: With dead ends: 1950 [2025-01-08 23:39:52,620 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:39:52,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:39:52,622 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:39:52,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 8 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:39:52,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:39:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:39:52,622 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-08 23:39:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:39:52,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 354 [2025-01-08 23:39:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:39:52,623 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:39:52,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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-08 23:39:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:39:52,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:39:52,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:39:52,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:39:52,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:39:52,828 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:39:52,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:39:52,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:39:52,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:39:52 BoogieIcfgContainer [2025-01-08 23:39:52,995 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:39:52,995 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:39:52,995 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:39:52,995 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:39:52,996 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:39:42" (3/4) ... [2025-01-08 23:39:52,997 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:39:53,010 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:39:53,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:39:53,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:39:53,011 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:39:53,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:39:53,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:39:53,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:39:53,085 INFO L158 Benchmark]: Toolchain (without parser) took 11657.76ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 157.4MB in the beginning and 252.7MB in the end (delta: -95.2MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,085 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:39:53,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.02ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 130.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.35ms. Allocated memory is still 201.3MB. Free memory was 130.6MB in the beginning and 122.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,086 INFO L158 Benchmark]: Boogie Preprocessor took 85.84ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 113.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,086 INFO L158 Benchmark]: RCFGBuilder took 901.46ms. Allocated memory is still 201.3MB. Free memory was 113.3MB in the beginning and 120.3MB in the end (delta: -7.0MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,086 INFO L158 Benchmark]: TraceAbstraction took 10223.82ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 119.4MB in the beginning and 265.2MB in the end (delta: -145.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,086 INFO L158 Benchmark]: Witness Printer took 89.26ms. Allocated memory is still 352.3MB. Free memory was 265.0MB in the beginning and 252.7MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:39:53,087 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.69ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.02ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 130.6MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.35ms. Allocated memory is still 201.3MB. Free memory was 130.6MB in the beginning and 122.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.84ms. Allocated memory is still 201.3MB. Free memory was 122.9MB in the beginning and 113.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 901.46ms. Allocated memory is still 201.3MB. Free memory was 113.3MB in the beginning and 120.3MB in the end (delta: -7.0MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10223.82ms. Allocated memory was 201.3MB in the beginning and 352.3MB in the end (delta: 151.0MB). Free memory was 119.4MB in the beginning and 265.2MB in the end (delta: -145.8MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 89.26ms. Allocated memory is still 352.3MB. Free memory was 265.0MB in the beginning and 252.7MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. 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: 152]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1220 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1220 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5353 IncrementalHoareTripleChecker+Invalid, 6047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 694 mSolverCounterUnsat, 1180 mSDtfsCounter, 5353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 644 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1255occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3348 NumberOfCodeBlocks, 3348 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3333 ConstructedInterpolants, 0 QuantifiedInterpolants, 10836 SizeOfPredicates, 0 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 2635/2799 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: 592]: Loop Invariant Derived loop invariant: (((((((a19 == 9) && (14 == a4)) && (a12 == 0)) || ((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (10 <= a19))) || ((((a19 <= 9) && (a10 != 1)) && (14 == a4)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || ((((0 <= ((long long) a1 + 12)) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:39:53,099 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