./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:24:52,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:24:52,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:24:52,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:24:52,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:24:52,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:24:52,345 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:24:52,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:24:52,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:24:52,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:24:52,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:24:52,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:24:52,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:24:52,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:24:52,352 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:24:52,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:24:52,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:24:52,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:24:52,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:24:52,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:24:52,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:24:52,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:24:52,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:24:52,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:24:52,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:24:52,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:24:52,359 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:24:52,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:24:52,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:24:52,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:24:52,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:24:52,362 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:24:52,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:24:52,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:24:52,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:24:52,364 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:24:52,364 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:24:52,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:24:52,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:24:52,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:24:52,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:24:52,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:24:52,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25a329399ac3f0c42bfd0b3752cc2a04cb2662736babf7dc26be2e3a4966221c [2024-10-13 23:24:52,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:24:52,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:24:52,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:24:52,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:24:52,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:24:52,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2024-10-13 23:24:54,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:24:54,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:24:54,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c [2024-10-13 23:24:54,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b296aff/f8ad955beb4949e79ab656444fe1e209/FLAGbd9fbc8a5 [2024-10-13 23:24:54,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22b296aff/f8ad955beb4949e79ab656444fe1e209 [2024-10-13 23:24:54,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:24:54,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:24:54,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:24:54,692 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:24:54,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:24:54,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:24:54" (1/1) ... [2024-10-13 23:24:54,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3936d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:54, skipping insertion in model container [2024-10-13 23:24:54,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:24:54" (1/1) ... [2024-10-13 23:24:54,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:24:54,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c[6098,6111] [2024-10-13 23:24:55,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:24:55,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:24:55,184 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label01.c[6098,6111] [2024-10-13 23:24:55,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:24:55,292 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:24:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55 WrapperNode [2024-10-13 23:24:55,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:24:55,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:24:55,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:24:55,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:24:55,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,397 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-13 23:24:55,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:24:55,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:24:55,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:24:55,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:24:55,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,464 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]. [2024-10-13 23:24:55,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:24:55,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:24:55,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:24:55,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:24:55,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (1/1) ... [2024-10-13 23:24:55,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:24:55,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:24:55,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:24:55,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:24:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:24:55,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:24:55,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:24:55,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:24:55,682 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:24:55,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:24:56,664 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-13 23:24:56,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:24:56,768 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:24:56,769 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:24:56,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:24:56 BoogieIcfgContainer [2024-10-13 23:24:56,770 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:24:56,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:24:56,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:24:56,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:24:56,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:24:54" (1/3) ... [2024-10-13 23:24:56,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae673f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:24:56, skipping insertion in model container [2024-10-13 23:24:56,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:24:55" (2/3) ... [2024-10-13 23:24:56,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae673f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:24:56, skipping insertion in model container [2024-10-13 23:24:56,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:24:56" (3/3) ... [2024-10-13 23:24:56,778 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label01.c [2024-10-13 23:24:56,794 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:24:56,794 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:24:56,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:24:56,861 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;@3c687597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:24:56,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:24:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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) [2024-10-13 23:24:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 23:24:56,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:24:56,875 INFO L215 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] [2024-10-13 23:24:56,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:24:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:24:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1110560882, now seen corresponding path program 1 times [2024-10-13 23:24:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:24:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871333676] [2024-10-13 23:24:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:24:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:24:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:24:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:24:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:24:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871333676] [2024-10-13 23:24:57,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871333676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:24:57,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:24:57,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:24:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398308890] [2024-10-13 23:24:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:24:57,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:24:57,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:24:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:24:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:24:57,134 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 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 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2024-10-13 23:24:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:24:57,176 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-13 23:24:57,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:24:57,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2024-10-13 23:24:57,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:24:57,189 INFO L225 Difference]: With dead ends: 287 [2024-10-13 23:24:57,190 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 23:24:57,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:24:57,198 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:24:57,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:24:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 23:24:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 23:24:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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) [2024-10-13 23:24:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-13 23:24:57,249 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 52 [2024-10-13 23:24:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:24:57,250 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-13 23:24:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2024-10-13 23:24:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-13 23:24:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 23:24:57,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:24:57,251 INFO L215 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] [2024-10-13 23:24:57,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:24:57,252 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:24:57,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:24:57,253 INFO L85 PathProgramCache]: Analyzing trace with hash -221621762, now seen corresponding path program 1 times [2024-10-13 23:24:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:24:57,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082837816] [2024-10-13 23:24:57,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:24:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:24:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:24:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:24:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:24:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082837816] [2024-10-13 23:24:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082837816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:24:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:24:57,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:24:57,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740461422] [2024-10-13 23:24:57,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:24:57,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:24:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:24:57,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:24:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:24:57,609 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-13 23:24:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:24:58,550 INFO L93 Difference]: Finished difference Result 561 states and 863 transitions. [2024-10-13 23:24:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:24:58,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2024-10-13 23:24:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:24:58,554 INFO L225 Difference]: With dead ends: 561 [2024-10-13 23:24:58,554 INFO L226 Difference]: Without dead ends: 420 [2024-10-13 23:24:58,555 INFO L431 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 [2024-10-13 23:24:58,556 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 410 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:24:58,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 14 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:24:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-13 23:24:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-13 23:24:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 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) [2024-10-13 23:24:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-13 23:24:58,587 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 52 [2024-10-13 23:24:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:24:58,590 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-13 23:24:58,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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) [2024-10-13 23:24:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-13 23:24:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-13 23:24:58,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:24:58,600 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:24:58,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:24:58,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:24:58,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:24:58,603 INFO L85 PathProgramCache]: Analyzing trace with hash -442168436, now seen corresponding path program 1 times [2024-10-13 23:24:58,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:24:58,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993310985] [2024-10-13 23:24:58,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:24:58,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:24:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:24:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 23:24:59,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:24:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993310985] [2024-10-13 23:24:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993310985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:24:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:24:59,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:24:59,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449690132] [2024-10-13 23:24:59,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:24:59,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:24:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:24:59,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:24:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:24:59,007 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-10-13 23:24:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:24:59,430 INFO L93 Difference]: Finished difference Result 978 states and 1439 transitions. [2024-10-13 23:24:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:24:59,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 233 [2024-10-13 23:24:59,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:24:59,439 INFO L225 Difference]: With dead ends: 978 [2024-10-13 23:24:59,439 INFO L226 Difference]: Without dead ends: 698 [2024-10-13 23:24:59,440 INFO L431 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 [2024-10-13 23:24:59,441 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 89 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:24:59,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 223 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:24:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-13 23:24:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 559. [2024-10-13 23:24:59,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3154121863799284) internal successors, (734), 558 states have internal predecessors, (734), 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) [2024-10-13 23:24:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 734 transitions. [2024-10-13 23:24:59,467 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 734 transitions. Word has length 233 [2024-10-13 23:24:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:24:59,468 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 734 transitions. [2024-10-13 23:24:59,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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) [2024-10-13 23:24:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 734 transitions. [2024-10-13 23:24:59,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-10-13 23:24:59,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:24:59,472 INFO L215 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:24:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:24:59,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:24:59,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:24:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1721175547, now seen corresponding path program 1 times [2024-10-13 23:24:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:24:59,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429662702] [2024-10-13 23:24:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:24:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:24:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:24:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-13 23:24:59,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:24:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429662702] [2024-10-13 23:24:59,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429662702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:24:59,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:24:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:24:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105214405] [2024-10-13 23:24:59,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:24:59,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:24:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:24:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:24:59,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:24:59,743 INFO L87 Difference]: Start difference. First operand 559 states and 734 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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) [2024-10-13 23:25:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:00,203 INFO L93 Difference]: Finished difference Result 1117 states and 1532 transitions. [2024-10-13 23:25:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 239 [2024-10-13 23:25:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:00,207 INFO L225 Difference]: With dead ends: 1117 [2024-10-13 23:25:00,207 INFO L226 Difference]: Without dead ends: 698 [2024-10-13 23:25:00,208 INFO L431 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 [2024-10-13 23:25:00,209 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:00,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:00,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-13 23:25:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698. [2024-10-13 23:25:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.2812051649928264) internal successors, (893), 697 states have internal predecessors, (893), 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) [2024-10-13 23:25:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 893 transitions. [2024-10-13 23:25:00,232 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 893 transitions. Word has length 239 [2024-10-13 23:25:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:00,233 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 893 transitions. [2024-10-13 23:25:00,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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) [2024-10-13 23:25:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 893 transitions. [2024-10-13 23:25:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-10-13 23:25:00,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:00,243 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:00,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:25:00,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:00,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1146210237, now seen corresponding path program 1 times [2024-10-13 23:25:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268944360] [2024-10-13 23:25:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-13 23:25:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268944360] [2024-10-13 23:25:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268944360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899313557] [2024-10-13 23:25:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:00,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:00,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:25:00,541 INFO L87 Difference]: Start difference. First operand 698 states and 893 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2024-10-13 23:25:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:00,978 INFO L93 Difference]: Finished difference Result 1395 states and 1830 transitions. [2024-10-13 23:25:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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 307 [2024-10-13 23:25:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:00,982 INFO L225 Difference]: With dead ends: 1395 [2024-10-13 23:25:00,983 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 23:25:00,983 INFO L431 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 [2024-10-13 23:25:00,985 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:00,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 212 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 23:25:01,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-13 23:25:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2464114832535884) internal successors, (1042), 836 states have internal predecessors, (1042), 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) [2024-10-13 23:25:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1042 transitions. [2024-10-13 23:25:01,005 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1042 transitions. Word has length 307 [2024-10-13 23:25:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:01,005 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1042 transitions. [2024-10-13 23:25:01,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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) [2024-10-13 23:25:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1042 transitions. [2024-10-13 23:25:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-10-13 23:25:01,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:01,010 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:01,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:25:01,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:01,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:01,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1691955193, now seen corresponding path program 1 times [2024-10-13 23:25:01,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:01,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227652413] [2024-10-13 23:25:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:01,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 23:25:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:01,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227652413] [2024-10-13 23:25:01,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227652413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:01,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 23:25:01,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243735807] [2024-10-13 23:25:01,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:01,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 23:25:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:01,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 23:25:01,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:01,624 INFO L87 Difference]: Start difference. First operand 837 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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) [2024-10-13 23:25:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:02,072 INFO L93 Difference]: Finished difference Result 1589 states and 1994 transitions. [2024-10-13 23:25:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 23:25:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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 316 [2024-10-13 23:25:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:02,076 INFO L225 Difference]: With dead ends: 1589 [2024-10-13 23:25:02,076 INFO L226 Difference]: Without dead ends: 837 [2024-10-13 23:25:02,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:02,079 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:02,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 20 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-13 23:25:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-13 23:25:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2416267942583732) internal successors, (1038), 836 states have internal predecessors, (1038), 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) [2024-10-13 23:25:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1038 transitions. [2024-10-13 23:25:02,101 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1038 transitions. Word has length 316 [2024-10-13 23:25:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:02,101 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1038 transitions. [2024-10-13 23:25:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 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) [2024-10-13 23:25:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1038 transitions. [2024-10-13 23:25:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-10-13 23:25:02,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:02,106 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:25:02,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:25:02,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:02,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 816566559, now seen corresponding path program 1 times [2024-10-13 23:25:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:02,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342210540] [2024-10-13 23:25:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:02,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 352 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:25:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342210540] [2024-10-13 23:25:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342210540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:02,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534226508] [2024-10-13 23:25:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:02,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:02,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:02,549 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:25:02,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:25:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:02,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:02,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 23:25:02,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:02,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534226508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:02,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:25:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119421418] [2024-10-13 23:25:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:02,966 INFO L87 Difference]: Start difference. First operand 837 states and 1038 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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) [2024-10-13 23:25:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:03,450 INFO L93 Difference]: Finished difference Result 2090 states and 2636 transitions. [2024-10-13 23:25:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:03,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 352 [2024-10-13 23:25:03,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:03,456 INFO L225 Difference]: With dead ends: 2090 [2024-10-13 23:25:03,456 INFO L226 Difference]: Without dead ends: 1393 [2024-10-13 23:25:03,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:25:03,457 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 26 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:03,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 192 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:25:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-13 23:25:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2024-10-13 23:25:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1989942528735633) internal successors, (1669), 1392 states have internal predecessors, (1669), 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) [2024-10-13 23:25:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1669 transitions. [2024-10-13 23:25:03,478 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1669 transitions. Word has length 352 [2024-10-13 23:25:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:03,479 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1669 transitions. [2024-10-13 23:25:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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) [2024-10-13 23:25:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1669 transitions. [2024-10-13 23:25:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-13 23:25:03,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:03,484 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:25:03,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:25:03,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:03,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:03,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1926797255, now seen corresponding path program 1 times [2024-10-13 23:25:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460789411] [2024-10-13 23:25:03,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:03,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 102 proven. 232 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-10-13 23:25:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460789411] [2024-10-13 23:25:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460789411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:25:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728710047] [2024-10-13 23:25:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:04,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:25:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:25:04,412 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:25:04,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:25:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:04,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:25:04,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:25:04,631 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-13 23:25:04,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:25:04,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728710047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:04,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:25:04,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-13 23:25:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321545575] [2024-10-13 23:25:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:04,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:25:04,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:25:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:04,633 INFO L87 Difference]: Start difference. First operand 1393 states and 1669 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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) [2024-10-13 23:25:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:05,102 INFO L93 Difference]: Finished difference Result 3063 states and 3735 transitions. [2024-10-13 23:25:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:25:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 365 [2024-10-13 23:25:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:05,109 INFO L225 Difference]: With dead ends: 3063 [2024-10-13 23:25:05,109 INFO L226 Difference]: Without dead ends: 1810 [2024-10-13 23:25:05,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:25:05,114 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 89 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:05,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 222 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:05,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-13 23:25:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1671. [2024-10-13 23:25:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1670 states have (on average 1.1808383233532933) internal successors, (1972), 1670 states have internal predecessors, (1972), 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) [2024-10-13 23:25:05,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1972 transitions. [2024-10-13 23:25:05,143 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1972 transitions. Word has length 365 [2024-10-13 23:25:05,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:05,144 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 1972 transitions. [2024-10-13 23:25:05,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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) [2024-10-13 23:25:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1972 transitions. [2024-10-13 23:25:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-13 23:25:05,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:25:05,163 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:25:05,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:25:05,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 23:25:05,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:25:05,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:25:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1705563854, now seen corresponding path program 1 times [2024-10-13 23:25:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:25:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558061805] [2024-10-13 23:25:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:25:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:25:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:25:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-13 23:25:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:25:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558061805] [2024-10-13 23:25:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558061805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:25:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:25:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:25:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276040230] [2024-10-13 23:25:06,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:25:06,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:25:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:25:06,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:25:06,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:25:06,032 INFO L87 Difference]: Start difference. First operand 1671 states and 1972 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 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) [2024-10-13 23:25:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:25:06,418 INFO L93 Difference]: Finished difference Result 3067 states and 3616 transitions. [2024-10-13 23:25:06,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:25:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 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 366 [2024-10-13 23:25:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:25:06,419 INFO L225 Difference]: With dead ends: 3067 [2024-10-13 23:25:06,419 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:25:06,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:25:06,424 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:25:06,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 9 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:25:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:25:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:25:06,425 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) [2024-10-13 23:25:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:25:06,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 366 [2024-10-13 23:25:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:25:06,427 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:25:06,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 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) [2024-10-13 23:25:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:25:06,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:25:06,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:25:06,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:25:06,435 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:25:06,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:25:06,560 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:25:06,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:25:06 BoogieIcfgContainer [2024-10-13 23:25:06,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:25:06,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:25:06,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:25:06,579 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:25:06,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:24:56" (3/4) ... [2024-10-13 23:25:06,581 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:25:06,599 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:25:06,600 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:25:06,601 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:25:06,602 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:25:06,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:25:06,775 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:25:06,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:25:06,776 INFO L158 Benchmark]: Toolchain (without parser) took 12084.78ms. Allocated memory was 151.0MB in the beginning and 390.1MB in the end (delta: 239.1MB). Free memory was 77.0MB in the beginning and 341.9MB in the end (delta: -265.0MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,776 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:25:06,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.09ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 76.9MB in the beginning and 163.3MB in the end (delta: -86.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.20ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 155.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,777 INFO L158 Benchmark]: Boogie Preprocessor took 143.73ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 144.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,777 INFO L158 Benchmark]: RCFGBuilder took 1226.97ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 151.2MB in the end (delta: -6.7MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,778 INFO L158 Benchmark]: TraceAbstraction took 9806.05ms. Allocated memory was 201.3MB in the beginning and 325.1MB in the end (delta: 123.7MB). Free memory was 150.1MB in the beginning and 97.1MB in the end (delta: 53.0MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,778 INFO L158 Benchmark]: Witness Printer took 196.74ms. Allocated memory was 325.1MB in the beginning and 390.1MB in the end (delta: 65.0MB). Free memory was 97.1MB in the beginning and 341.9MB in the end (delta: -244.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-13 23:25:06,780 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.17ms. Allocated memory is still 151.0MB. Free memory is still 101.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.09ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 76.9MB in the beginning and 163.3MB in the end (delta: -86.4MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 104.20ms. Allocated memory is still 201.3MB. Free memory was 163.3MB in the beginning and 155.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.73ms. Allocated memory is still 201.3MB. Free memory was 155.0MB in the beginning and 144.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1226.97ms. Allocated memory is still 201.3MB. Free memory was 144.5MB in the beginning and 151.2MB in the end (delta: -6.7MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9806.05ms. Allocated memory was 201.3MB in the beginning and 325.1MB in the end (delta: 123.7MB). Free memory was 150.1MB in the beginning and 97.1MB in the end (delta: 53.0MB). Peak memory consumption was 177.8MB. Max. memory is 16.1GB. * Witness Printer took 196.74ms. Allocated memory was 325.1MB in the beginning and 390.1MB in the end (delta: 65.0MB). Free memory was 97.1MB in the beginning and 341.9MB in the end (delta: -244.8MB). Peak memory consumption was 7.9MB. 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: 173]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 976 mSDsluCounter, 1141 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3307 IncrementalHoareTripleChecker+Invalid, 3815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 1098 mSDtfsCounter, 3307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 749 GetRequests, 728 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1671occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 278 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2999 NumberOfCodeBlocks, 2999 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2988 ConstructedInterpolants, 0 QuantifiedInterpolants, 11912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 2829/3106 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (((((((a10 == 0) && (14 == a4)) && (((long long) a1 + 551894) <= 0)) && (a12 == 0)) || (((a19 != 6) && (14 == a4)) && (a12 == 0))) || (((a10 == 3) && (14 == a4)) && (a12 == 0))) || (((4 <= a10) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:25:06,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE