./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label54.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_label54.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 feb39bca06af67d7ac060da1dc3bc8180fef7df0c321a0d50ad90b8125c604ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:40:17,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:40:17,205 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:40:17,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:40:17,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:40:17,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:40:17,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:40:17,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:40:17,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:40:17,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:40:17,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:40:17,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:40:17,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:17,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:40:17,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:17,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:40:17,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:40:17,245 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 -> feb39bca06af67d7ac060da1dc3bc8180fef7df0c321a0d50ad90b8125c604ff [2025-01-08 23:40:17,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:40:17,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:40:17,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:40:17,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:40:17,461 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:40:17,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label54.c [2025-01-08 23:40:18,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d39e5637/bd5cfc4d081b4b7dbc277230bbd73001/FLAG8e0d73f5c [2025-01-08 23:40:18,865 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:40:18,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label54.c [2025-01-08 23:40:18,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d39e5637/bd5cfc4d081b4b7dbc277230bbd73001/FLAG8e0d73f5c [2025-01-08 23:40:19,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d39e5637/bd5cfc4d081b4b7dbc277230bbd73001 [2025-01-08 23:40:19,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:40:19,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:40:19,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:19,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:40:19,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:40:19,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601453e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19, skipping insertion in model container [2025-01-08 23:40:19,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:40:19,306 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_label54.c[7067,7080] [2025-01-08 23:40:19,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:19,414 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:40:19,435 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_label54.c[7067,7080] [2025-01-08 23:40:19,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:19,486 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:40:19,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19 WrapperNode [2025-01-08 23:40:19,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:19,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:19,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:40:19,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:40:19,493 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:40:19" (1/1) ... [2025-01-08 23:40:19,509 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:40:19" (1/1) ... [2025-01-08 23:40:19,548 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-01-08 23:40:19,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:19,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:40:19,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:40:19,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:40:19,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,586 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:40:19,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:40:19,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:40:19,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:40:19,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:40:19,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (1/1) ... [2025-01-08 23:40:19,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:19,664 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:40:19,666 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:40:19,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:40:19,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:40:19,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:40:19,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:40:19,733 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:40:19,734 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:40:20,546 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 23:40:20,546 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:40:20,559 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:40:20,559 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:40:20,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:20 BoogieIcfgContainer [2025-01-08 23:40:20,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:40:20,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:40:20,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:40:20,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:40:20,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:40:19" (1/3) ... [2025-01-08 23:40:20,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ff863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:20, skipping insertion in model container [2025-01-08 23:40:20,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:19" (2/3) ... [2025-01-08 23:40:20,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357ff863 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:20, skipping insertion in model container [2025-01-08 23:40:20,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:20" (3/3) ... [2025-01-08 23:40:20,569 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label54.c [2025-01-08 23:40:20,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:40:20,583 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label54.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:40:20,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:40:20,644 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;@36c502b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:40:20,644 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:40:20,648 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:40:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 23:40:20,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:20,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:20,655 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2137131158, now seen corresponding path program 1 times [2025-01-08 23:40:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:20,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961486886] [2025-01-08 23:40:20,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:20,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:20,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 23:40:20,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 23:40:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:21,172 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:40:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:21,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961486886] [2025-01-08 23:40:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961486886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:21,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983142544] [2025-01-08 23:40:21,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:21,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:21,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:21,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:21,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:21,196 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:40:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:22,128 INFO L93 Difference]: Finished difference Result 696 states and 1244 transitions. [2025-01-08 23:40:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:22,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-01-08 23:40:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:22,141 INFO L225 Difference]: With dead ends: 696 [2025-01-08 23:40:22,141 INFO L226 Difference]: Without dead ends: 421 [2025-01-08 23:40:22,145 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:40:22,146 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 449 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:22,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 44 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:40:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-08 23:40:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-01-08 23:40:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 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:40:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2025-01-08 23:40:22,194 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 62 [2025-01-08 23:40:22,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:22,195 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2025-01-08 23:40:22,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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:40:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2025-01-08 23:40:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 23:40:22,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:22,199 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, 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] [2025-01-08 23:40:22,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:40:22,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1691438591, now seen corresponding path program 1 times [2025-01-08 23:40:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974613350] [2025-01-08 23:40:22,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:22,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:22,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 23:40:22,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 23:40:22,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:22,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974613350] [2025-01-08 23:40:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974613350] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:22,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:22,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:40:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883187180] [2025-01-08 23:40:22,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:22,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:40:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:22,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:40:22,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:40:22,616 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 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:40:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:23,130 INFO L93 Difference]: Finished difference Result 756 states and 1066 transitions. [2025-01-08 23:40:23,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:40:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 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 137 [2025-01-08 23:40:23,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:23,134 INFO L225 Difference]: With dead ends: 756 [2025-01-08 23:40:23,134 INFO L226 Difference]: Without dead ends: 421 [2025-01-08 23:40:23,135 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:40:23,135 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:23,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 30 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-08 23:40:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-01-08 23:40:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3761904761904762) internal successors, (578), 420 states have internal predecessors, (578), 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:40:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2025-01-08 23:40:23,159 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 137 [2025-01-08 23:40:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2025-01-08 23:40:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 6 states have internal predecessors, (137), 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:40:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2025-01-08 23:40:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-08 23:40:23,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:23,171 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:23,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:40:23,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -260779166, now seen corresponding path program 1 times [2025-01-08 23:40:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:23,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167468488] [2025-01-08 23:40:23,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:23,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:23,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-08 23:40:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-08 23:40:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:40:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167468488] [2025-01-08 23:40:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167468488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:23,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564922702] [2025-01-08 23:40:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:23,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:23,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:23,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:23,373 INFO L87 Difference]: Start difference. First operand 421 states and 578 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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:40:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:23,764 INFO L93 Difference]: Finished difference Result 840 states and 1219 transitions. [2025-01-08 23:40:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 197 [2025-01-08 23:40:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:23,767 INFO L225 Difference]: With dead ends: 840 [2025-01-08 23:40:23,767 INFO L226 Difference]: Without dead ends: 560 [2025-01-08 23:40:23,767 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:40:23,768 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:23,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 34 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-08 23:40:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-01-08 23:40:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3166368515205724) internal successors, (736), 559 states have internal predecessors, (736), 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:40:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 736 transitions. [2025-01-08 23:40:23,787 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 736 transitions. Word has length 197 [2025-01-08 23:40:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 736 transitions. [2025-01-08 23:40:23,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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:40:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 736 transitions. [2025-01-08 23:40:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-08 23:40:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:23,792 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:23,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:40:23,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 761369808, now seen corresponding path program 1 times [2025-01-08 23:40:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:23,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113999749] [2025-01-08 23:40:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:23,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-08 23:40:23,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-08 23:40:23,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:23,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:23,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113999749] [2025-01-08 23:40:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113999749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61782976] [2025-01-08 23:40:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:23,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:23,984 INFO L87 Difference]: Start difference. First operand 560 states and 736 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:40:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:24,325 INFO L93 Difference]: Finished difference Result 1257 states and 1704 transitions. [2025-01-08 23:40:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 214 [2025-01-08 23:40:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:24,329 INFO L225 Difference]: With dead ends: 1257 [2025-01-08 23:40:24,329 INFO L226 Difference]: Without dead ends: 838 [2025-01-08 23:40:24,329 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:40:24,330 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:24,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 214 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-08 23:40:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-01-08 23:40:24,339 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:40:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 885 transitions. [2025-01-08 23:40:24,340 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 885 transitions. Word has length 214 [2025-01-08 23:40:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:24,340 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 885 transitions. [2025-01-08 23:40:24,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:40:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 885 transitions. [2025-01-08 23:40:24,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 23:40:24,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:24,342 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:24,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:40:24,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:24,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1409239769, now seen corresponding path program 1 times [2025-01-08 23:40:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057777956] [2025-01-08 23:40:24,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:24,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:24,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 23:40:24,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 23:40:24,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:24,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:24,670 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:40:24,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:24,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057777956] [2025-01-08 23:40:24,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057777956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:24,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:24,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:40:24,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944901197] [2025-01-08 23:40:24,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:24,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:40:24,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:24,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:40:24,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:40:24,671 INFO L87 Difference]: Start difference. First operand 699 states and 885 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 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:40:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:25,069 INFO L93 Difference]: Finished difference Result 1319 states and 1687 transitions. [2025-01-08 23:40:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:40:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 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 236 [2025-01-08 23:40:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:25,072 INFO L225 Difference]: With dead ends: 1319 [2025-01-08 23:40:25,072 INFO L226 Difference]: Without dead ends: 699 [2025-01-08 23:40:25,073 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:40:25,074 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 119 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:25,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 31 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:40:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-01-08 23:40:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-01-08 23:40:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2578796561604584) internal successors, (878), 698 states have internal predecessors, (878), 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:40:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 878 transitions. [2025-01-08 23:40:25,084 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 878 transitions. Word has length 236 [2025-01-08 23:40:25,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:25,085 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 878 transitions. [2025-01-08 23:40:25,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 6 states have internal predecessors, (172), 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:40:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 878 transitions. [2025-01-08 23:40:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-08 23:40:25,087 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:25,087 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, 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, 1, 1, 1, 1, 1, 1, 1, 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:40:25,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:40:25,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:25,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1549553921, now seen corresponding path program 1 times [2025-01-08 23:40:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104014371] [2025-01-08 23:40:25,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:25,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-08 23:40:25,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-08 23:40:25,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:25,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:25,234 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:25,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:25,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104014371] [2025-01-08 23:40:25,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104014371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:25,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:25,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:25,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146116184] [2025-01-08 23:40:25,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:25,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:25,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:25,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:25,236 INFO L87 Difference]: Start difference. First operand 699 states and 878 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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:40:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:25,592 INFO L93 Difference]: Finished difference Result 1535 states and 2008 transitions. [2025-01-08 23:40:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:25,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 259 [2025-01-08 23:40:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:25,595 INFO L225 Difference]: With dead ends: 1535 [2025-01-08 23:40:25,595 INFO L226 Difference]: Without dead ends: 977 [2025-01-08 23:40:25,596 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:40:25,597 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 67 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:25,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 189 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:25,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-08 23:40:25,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2025-01-08 23:40:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2336065573770492) internal successors, (1204), 976 states have internal predecessors, (1204), 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:40:25,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1204 transitions. [2025-01-08 23:40:25,611 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1204 transitions. Word has length 259 [2025-01-08 23:40:25,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:25,611 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1204 transitions. [2025-01-08 23:40:25,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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:40:25,611 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1204 transitions. [2025-01-08 23:40:25,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-08 23:40:25,613 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:25,614 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:40:25,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:25,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:25,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1597717456, now seen corresponding path program 1 times [2025-01-08 23:40:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282433523] [2025-01-08 23:40:25,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:25,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:25,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 23:40:25,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 23:40:25,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:25,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-08 23:40:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:25,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282433523] [2025-01-08 23:40:25,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282433523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:25,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:25,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94912681] [2025-01-08 23:40:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:25,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:25,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:25,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:25,784 INFO L87 Difference]: Start difference. First operand 977 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 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:40:26,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:26,138 INFO L93 Difference]: Finished difference Result 1952 states and 2449 transitions. [2025-01-08 23:40:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:26,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 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 278 [2025-01-08 23:40:26,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:26,141 INFO L225 Difference]: With dead ends: 1952 [2025-01-08 23:40:26,143 INFO L226 Difference]: Without dead ends: 1116 [2025-01-08 23:40:26,144 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:40:26,144 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:26,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 75 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-01-08 23:40:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-01-08 23:40:26,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.1632286995515695) internal successors, (1297), 1115 states have internal predecessors, (1297), 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:40:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1297 transitions. [2025-01-08 23:40:26,163 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1297 transitions. Word has length 278 [2025-01-08 23:40:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:26,163 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1297 transitions. [2025-01-08 23:40:26,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 2 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:40:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1297 transitions. [2025-01-08 23:40:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-01-08 23:40:26,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:26,167 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:26,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:40:26,167 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:26,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -751687191, now seen corresponding path program 1 times [2025-01-08 23:40:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807630695] [2025-01-08 23:40:26,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:26,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-08 23:40:26,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-08 23:40:26,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:26,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:40:26,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807630695] [2025-01-08 23:40:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807630695] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:26,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248537817] [2025-01-08 23:40:26,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:26,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:26,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:26,446 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:40:26,449 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:40:26,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-01-08 23:40:26,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-01-08 23:40:26,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:26,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:26,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:40:26,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-08 23:40:26,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:26,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248537817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:40:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18373413] [2025-01-08 23:40:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:26,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:26,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:26,660 INFO L87 Difference]: Start difference. First operand 1116 states and 1297 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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:40:27,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:27,026 INFO L93 Difference]: Finished difference Result 2228 states and 2634 transitions. [2025-01-08 23:40:27,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:27,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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 310 [2025-01-08 23:40:27,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:27,028 INFO L225 Difference]: With dead ends: 2228 [2025-01-08 23:40:27,028 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:40:27,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:40:27,030 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 80 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 220 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:40:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:40:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:40:27,031 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:40:27,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:40:27,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 310 [2025-01-08 23:40:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:27,031 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:40:27,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 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:40:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:40:27,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:40:27,033 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:40:27,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:40:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:27,240 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:27,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:40:27,343 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:40:27,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:40:27 BoogieIcfgContainer [2025-01-08 23:40:27,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:40:27,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:40:27,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:40:27,363 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:40:27,364 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:20" (3/4) ... [2025-01-08 23:40:27,366 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:40:27,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:40:27,380 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:40:27,381 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:40:27,381 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:40:27,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:40:27,466 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:40:27,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:40:27,467 INFO L158 Benchmark]: Toolchain (without parser) took 8331.28ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 103.4MB in the beginning and 131.0MB in the end (delta: -27.5MB). Peak memory consumption was 180.0MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,467 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:40:27,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.05ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 76.2MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.32ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 69.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,468 INFO L158 Benchmark]: Boogie Preprocessor took 89.06ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 59.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,468 INFO L158 Benchmark]: RCFGBuilder took 921.08ms. Allocated memory is still 142.6MB. Free memory was 59.4MB in the beginning and 97.1MB in the end (delta: -37.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,468 INFO L158 Benchmark]: TraceAbstraction took 6801.40ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 97.1MB in the beginning and 141.0MB in the end (delta: -43.9MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,468 INFO L158 Benchmark]: Witness Printer took 103.62ms. Allocated memory is still 352.3MB. Free memory was 141.0MB in the beginning and 131.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:40:27,469 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.05ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 76.2MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.32ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 69.0MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.06ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 59.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 921.08ms. Allocated memory is still 142.6MB. Free memory was 59.4MB in the beginning and 97.1MB in the end (delta: -37.7MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6801.40ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 97.1MB in the beginning and 141.0MB in the end (delta: -43.9MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. * Witness Printer took 103.62ms. Allocated memory is still 352.3MB. Free memory was 141.0MB in the beginning and 131.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. 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: 200]: 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: 6.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1035 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1035 mSDsluCounter, 837 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 597 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4117 IncrementalHoareTripleChecker+Invalid, 4714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 597 mSolverCounterUnsat, 762 mSDtfsCounter, 4117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=7, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 139 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2003 NumberOfCodeBlocks, 2003 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1994 ConstructedInterpolants, 0 QuantifiedInterpolants, 8628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 1379/1477 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: ((((((((a10 == 0) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (a19 != 8)) && (14 == a4)) && (a12 == 0))) || ((((a10 <= 0) && (a19 != 8)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:40:27,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE