./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/Problem14_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label06.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4ac6301e42f829c2e7435f753cf6d38a67b1a5fed7ebb544243474a63eb4f91e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:32:15,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:32:15,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:32:15,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:32:15,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:32:15,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:32:15,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:32:15,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:32:15,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:32:15,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:32:15,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:32:15,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:32:15,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:32:15,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:32:15,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:32:15,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:32:15,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:32:15,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:32:15,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:32:15,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:32:15,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:32:15,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:32:15,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:32:15,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:32:15,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:32:15,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:32:15,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:32:15,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:32:15,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:32:15,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:32:15,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:32:15,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:32:15,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:32:15,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:32:15,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:32:15,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:32:15,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:32:15,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:32:15,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:32:15,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:32:15,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:32:15,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:32:15,624 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-clean/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-clean/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 -> 4ac6301e42f829c2e7435f753cf6d38a67b1a5fed7ebb544243474a63eb4f91e [2024-10-10 23:32:15,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:32:15,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:32:15,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:32:15,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:32:15,864 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:32:15,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label06.c [2024-10-10 23:32:17,302 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:32:17,499 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:32:17,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label06.c [2024-10-10 23:32:17,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e01b74a/9269127e439b4f518ea7cce494eb3d38/FLAGa14ce02b0 [2024-10-10 23:32:17,865 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e01b74a/9269127e439b4f518ea7cce494eb3d38 [2024-10-10 23:32:17,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:32:17,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:32:17,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:32:17,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:32:17,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:32:17,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:32:17" (1/1) ... [2024-10-10 23:32:17,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfe7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:17, skipping insertion in model container [2024-10-10 23:32:17,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:32:17" (1/1) ... [2024-10-10 23:32:17,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:32:18,143 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/Problem14_label06.c[6235,6248] [2024-10-10 23:32:18,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:32:18,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:32:18,311 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/Problem14_label06.c[6235,6248] [2024-10-10 23:32:18,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:32:18,515 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:32:18,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18 WrapperNode [2024-10-10 23:32:18,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:32:18,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:32:18,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:32:18,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:32:18,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,609 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:32:18,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:32:18,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:32:18,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:32:18,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:32:18,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,654 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-10 23:32:18,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:32:18,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:32:18,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:32:18,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:32:18,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (1/1) ... [2024-10-10 23:32:18,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:32:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:18,766 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:32:18,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:32:18,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:32:18,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:32:18,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:32:18,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:32:18,860 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:32:18,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:32:19,806 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:32:19,806 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:32:19,848 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:32:19,849 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:32:19,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:19 BoogieIcfgContainer [2024-10-10 23:32:19,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:32:19,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:32:19,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:32:19,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:32:19,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:32:17" (1/3) ... [2024-10-10 23:32:19,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:32:19, skipping insertion in model container [2024-10-10 23:32:19,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:32:18" (2/3) ... [2024-10-10 23:32:19,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514a500d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:32:19, skipping insertion in model container [2024-10-10 23:32:19,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:19" (3/3) ... [2024-10-10 23:32:19,857 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label06.c [2024-10-10 23:32:19,870 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:32:19,870 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:32:19,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:32:19,948 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;@47b0865a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:32:19,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:32:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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-10 23:32:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:32:19,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:19,960 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:19,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:19,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:19,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1763143526, now seen corresponding path program 1 times [2024-10-10 23:32:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541056984] [2024-10-10 23:32:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:20,131 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-10 23:32:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541056984] [2024-10-10 23:32:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541056984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783270371] [2024-10-10 23:32:20,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:20,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:32:20,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:32:20,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:32:20,180 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-10 23:32:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:20,231 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:32:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:32:20,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-10 23:32:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:20,242 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:32:20,243 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:32:20,246 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-10 23:32:20,250 INFO L432 NwaCegarLoop]: 295 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, 295 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-10 23:32:20,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:32:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:32:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:32:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-10 23:32:20,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:32:20,293 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 60 [2024-10-10 23:32:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:20,294 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:32:20,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 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-10 23:32:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:32:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-10 23:32:20,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:20,295 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:20,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:32:20,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1492414635, now seen corresponding path program 1 times [2024-10-10 23:32:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814331661] [2024-10-10 23:32:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:20,435 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-10 23:32:20,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:20,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814331661] [2024-10-10 23:32:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814331661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:32:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662468056] [2024-10-10 23:32:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:20,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:20,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:20,442 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-10 23:32:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:21,092 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-10 23:32:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:21,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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 60 [2024-10-10 23:32:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:21,095 INFO L225 Difference]: With dead ends: 539 [2024-10-10 23:32:21,095 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:32:21,095 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-10 23:32:21,096 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:21,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:32:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:32:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:32:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 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-10 23:32:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-10 23:32:21,114 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 60 [2024-10-10 23:32:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-10 23:32:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 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-10 23:32:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-10 23:32:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-10 23:32:21,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:21,118 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-10 23:32:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:32:21,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -900272853, now seen corresponding path program 1 times [2024-10-10 23:32:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952952625] [2024-10-10 23:32:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952952625] [2024-10-10 23:32:21,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952952625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:21,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:21,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:21,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777093049] [2024-10-10 23:32:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:21,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:21,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:21,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:21,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:21,423 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-10 23:32:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:22,298 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-10 23:32:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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 139 [2024-10-10 23:32:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:22,302 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:32:22,302 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:32:22,304 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-10 23:32:22,304 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:22,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:32:22,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:32:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:32:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 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-10 23:32:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-10 23:32:22,326 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 139 [2024-10-10 23:32:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-10 23:32:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 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-10 23:32:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-10 23:32:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-10 23:32:22,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:22,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:32:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:32:22,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1510327028, now seen corresponding path program 1 times [2024-10-10 23:32:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742991782] [2024-10-10 23:32:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 23:32:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742991782] [2024-10-10 23:32:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742991782] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:22,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708430728] [2024-10-10 23:32:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:22,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:22,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:22,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:22,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:32:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:22,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:22,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:32:22,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708430728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:32:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728711267] [2024-10-10 23:32:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:22,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:22,970 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-10 23:32:23,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:23,820 INFO L93 Difference]: Finished difference Result 1963 states and 2498 transitions. [2024-10-10 23:32:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 165 [2024-10-10 23:32:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:23,829 INFO L225 Difference]: With dead ends: 1963 [2024-10-10 23:32:23,830 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:32:23,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 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-10 23:32:23,836 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:23,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 93 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:32:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:32:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-10-10 23:32:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 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-10 23:32:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2024-10-10 23:32:23,873 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 165 [2024-10-10 23:32:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:23,873 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2024-10-10 23:32:23,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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-10 23:32:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2024-10-10 23:32:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 23:32:23,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:23,885 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, 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, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:23,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:32:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:24,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:24,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash 311555096, now seen corresponding path program 1 times [2024-10-10 23:32:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875695004] [2024-10-10 23:32:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 23:32:24,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:24,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875695004] [2024-10-10 23:32:24,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875695004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:24,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156691202] [2024-10-10 23:32:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:24,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:24,263 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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-10 23:32:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:24,836 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2024-10-10 23:32:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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 219 [2024-10-10 23:32:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:24,842 INFO L225 Difference]: With dead ends: 2704 [2024-10-10 23:32:24,843 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:32:24,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10 23:32:24,848 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:24,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:32:24,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:32:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-10 23:32:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 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-10 23:32:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2024-10-10 23:32:24,909 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 219 [2024-10-10 23:32:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:24,910 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2024-10-10 23:32:24,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 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-10 23:32:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2024-10-10 23:32:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-10 23:32:24,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:24,913 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, 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, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:32:24,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:32:24,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash -552622274, now seen corresponding path program 1 times [2024-10-10 23:32:24,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:24,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105686650] [2024-10-10 23:32:24,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 224 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:32:25,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105686650] [2024-10-10 23:32:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105686650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766911904] [2024-10-10 23:32:25,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:25,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:25,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:25,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:25,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:32:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:25,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:25,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:32:25,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:25,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766911904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:25,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:25,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 23:32:25,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968782527] [2024-10-10 23:32:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:25,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:25,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:25,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:32:25,826 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 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-10 23:32:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:26,272 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2024-10-10 23:32:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 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 346 [2024-10-10 23:32:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:26,278 INFO L225 Difference]: With dead ends: 3387 [2024-10-10 23:32:26,278 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:32:26,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:32:26,281 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:26,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:26,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:32:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-10 23:32:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.131874298540965) internal successors, (2017), 1782 states have internal predecessors, (2017), 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-10 23:32:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2017 transitions. [2024-10-10 23:32:26,304 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2017 transitions. Word has length 346 [2024-10-10 23:32:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:26,304 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2017 transitions. [2024-10-10 23:32:26,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 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-10 23:32:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2017 transitions. [2024-10-10 23:32:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-10 23:32:26,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:26,307 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, 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, 2, 2, 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] [2024-10-10 23:32:26,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:32:26,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:26,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:26,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1627531528, now seen corresponding path program 1 times [2024-10-10 23:32:26,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:26,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608371270] [2024-10-10 23:32:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:32:26,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608371270] [2024-10-10 23:32:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608371270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354080295] [2024-10-10 23:32:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:26,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:26,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:26,846 INFO L87 Difference]: Start difference. First operand 1783 states and 2017 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-10 23:32:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:27,252 INFO L93 Difference]: Finished difference Result 3743 states and 4281 transitions. [2024-10-10 23:32:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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 350 [2024-10-10 23:32:27,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:27,257 INFO L225 Difference]: With dead ends: 3743 [2024-10-10 23:32:27,258 INFO L226 Difference]: Without dead ends: 2139 [2024-10-10 23:32:27,259 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-10 23:32:27,260 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:27,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 75 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-10 23:32:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-10 23:32:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.128157156220767) internal successors, (2412), 2138 states have internal predecessors, (2412), 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-10 23:32:27,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2412 transitions. [2024-10-10 23:32:27,286 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2412 transitions. Word has length 350 [2024-10-10 23:32:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:27,286 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2412 transitions. [2024-10-10 23:32:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 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-10 23:32:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2412 transitions. [2024-10-10 23:32:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-10 23:32:27,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:27,289 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-10-10 23:32:27,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:32:27,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:27,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 754955212, now seen corresponding path program 1 times [2024-10-10 23:32:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:27,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061152746] [2024-10-10 23:32:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:27,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061152746] [2024-10-10 23:32:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061152746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:27,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915420628] [2024-10-10 23:32:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:27,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:27,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:27,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:27,414 INFO L87 Difference]: Start difference. First operand 2139 states and 2412 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-10 23:32:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:27,872 INFO L93 Difference]: Finished difference Result 4633 states and 5315 transitions. [2024-10-10 23:32:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:27,872 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 377 [2024-10-10 23:32:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:27,879 INFO L225 Difference]: With dead ends: 4633 [2024-10-10 23:32:27,879 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:32:27,881 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-10 23:32:27,882 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:27,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 65 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:32:27,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2317. [2024-10-10 23:32:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.131692573402418) internal successors, (2621), 2316 states have internal predecessors, (2621), 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-10 23:32:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2621 transitions. [2024-10-10 23:32:27,910 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2621 transitions. Word has length 377 [2024-10-10 23:32:27,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:27,910 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2621 transitions. [2024-10-10 23:32:27,910 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-10 23:32:27,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2621 transitions. [2024-10-10 23:32:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-10-10 23:32:27,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:27,916 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:27,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:32:27,917 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:27,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:27,917 INFO L85 PathProgramCache]: Analyzing trace with hash 669200957, now seen corresponding path program 1 times [2024-10-10 23:32:27,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:27,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34642410] [2024-10-10 23:32:27,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:27,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-10 23:32:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34642410] [2024-10-10 23:32:28,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34642410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:28,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076004911] [2024-10-10 23:32:28,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:28,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:28,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:28,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:28,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:32:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:28,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:28,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:28,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076004911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:28,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-10 23:32:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666926112] [2024-10-10 23:32:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:28,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:28,355 INFO L87 Difference]: Start difference. First operand 2317 states and 2621 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-10 23:32:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:28,774 INFO L93 Difference]: Finished difference Result 4811 states and 5532 transitions. [2024-10-10 23:32:28,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:28,775 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 384 [2024-10-10 23:32:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:28,781 INFO L225 Difference]: With dead ends: 4811 [2024-10-10 23:32:28,781 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:32:28,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:28,784 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 123 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:28,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 221 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:32:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-10 23:32:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1399700598802396) internal successors, (3046), 2672 states have internal predecessors, (3046), 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-10 23:32:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3046 transitions. [2024-10-10 23:32:28,815 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3046 transitions. Word has length 384 [2024-10-10 23:32:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:28,815 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 3046 transitions. [2024-10-10 23:32:28,816 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-10 23:32:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3046 transitions. [2024-10-10 23:32:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-10 23:32:28,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:28,820 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:28,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:32:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:29,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:29,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1087854812, now seen corresponding path program 1 times [2024-10-10 23:32:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565726132] [2024-10-10 23:32:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565726132] [2024-10-10 23:32:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565726132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669482506] [2024-10-10 23:32:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:29,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:29,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:29,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:29,176 INFO L87 Difference]: Start difference. First operand 2673 states and 3046 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-10 23:32:29,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:29,630 INFO L93 Difference]: Finished difference Result 6057 states and 6994 transitions. [2024-10-10 23:32:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:29,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 456 [2024-10-10 23:32:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:29,641 INFO L225 Difference]: With dead ends: 6057 [2024-10-10 23:32:29,641 INFO L226 Difference]: Without dead ends: 3563 [2024-10-10 23:32:29,643 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-10 23:32:29,643 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 120 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:29,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 55 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-10 23:32:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3563. [2024-10-10 23:32:29,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.1400898371701291) internal successors, (4061), 3562 states have internal predecessors, (4061), 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-10 23:32:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 4061 transitions. [2024-10-10 23:32:29,678 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 4061 transitions. Word has length 456 [2024-10-10 23:32:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:29,679 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 4061 transitions. [2024-10-10 23:32:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-10 23:32:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 4061 transitions. [2024-10-10 23:32:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-10-10 23:32:29,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:29,682 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:29,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:32:29,683 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:29,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -427154333, now seen corresponding path program 1 times [2024-10-10 23:32:29,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032417990] [2024-10-10 23:32:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:30,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 739 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-10-10 23:32:30,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:30,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032417990] [2024-10-10 23:32:30,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032417990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:30,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:30,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:30,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115362668] [2024-10-10 23:32:30,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:30,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:30,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:30,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:30,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:30,014 INFO L87 Difference]: Start difference. First operand 3563 states and 4061 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-10 23:32:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:30,531 INFO L93 Difference]: Finished difference Result 7154 states and 8167 transitions. [2024-10-10 23:32:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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 531 [2024-10-10 23:32:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:30,541 INFO L225 Difference]: With dead ends: 7154 [2024-10-10 23:32:30,541 INFO L226 Difference]: Without dead ends: 3741 [2024-10-10 23:32:30,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-10 23:32:30,544 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:30,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:32:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-10 23:32:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3563. [2024-10-10 23:32:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0940482874789443) internal successors, (3897), 3562 states have internal predecessors, (3897), 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-10 23:32:30,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3897 transitions. [2024-10-10 23:32:30,590 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3897 transitions. Word has length 531 [2024-10-10 23:32:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:30,590 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3897 transitions. [2024-10-10 23:32:30,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-10 23:32:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3897 transitions. [2024-10-10 23:32:30,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-10-10 23:32:30,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:30,594 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-10 23:32:30,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:32:30,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:30,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:30,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2048637247, now seen corresponding path program 1 times [2024-10-10 23:32:30,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:30,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167878961] [2024-10-10 23:32:30,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:30,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-10-10 23:32:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167878961] [2024-10-10 23:32:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167878961] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298893208] [2024-10-10 23:32:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:30,944 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:30,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:32:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:31,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:31,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2024-10-10 23:32:31,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298893208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:31,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:31,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:32:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727183449] [2024-10-10 23:32:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:31,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:31,528 INFO L87 Difference]: Start difference. First operand 3563 states and 3897 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-10 23:32:31,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:31,886 INFO L93 Difference]: Finished difference Result 4633 states and 5053 transitions. [2024-10-10 23:32:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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 539 [2024-10-10 23:32:31,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:31,895 INFO L225 Difference]: With dead ends: 4633 [2024-10-10 23:32:31,895 INFO L226 Difference]: Without dead ends: 4631 [2024-10-10 23:32:31,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 538 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-10 23:32:31,896 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:31,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 9 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:32:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-10 23:32:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3741. [2024-10-10 23:32:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0954545454545455) internal successors, (4097), 3740 states have internal predecessors, (4097), 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-10 23:32:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4097 transitions. [2024-10-10 23:32:31,933 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4097 transitions. Word has length 539 [2024-10-10 23:32:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:31,934 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4097 transitions. [2024-10-10 23:32:31,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 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-10 23:32:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4097 transitions. [2024-10-10 23:32:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2024-10-10 23:32:31,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:31,938 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:31,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-10 23:32:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:32:32,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:32,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1831306542, now seen corresponding path program 1 times [2024-10-10 23:32:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986942925] [2024-10-10 23:32:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 943 proven. 11 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-10-10 23:32:32,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986942925] [2024-10-10 23:32:32,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986942925] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:32,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442226551] [2024-10-10 23:32:32,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:32,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:32,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:32,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:32:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:32,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:32,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-10-10 23:32:32,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442226551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:32:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894034364] [2024-10-10 23:32:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:32,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:32,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:32,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:32:32,905 INFO L87 Difference]: Start difference. First operand 3741 states and 4097 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:33,264 INFO L93 Difference]: Finished difference Result 5167 states and 5626 transitions. [2024-10-10 23:32:33,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:33,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586 [2024-10-10 23:32:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:33,274 INFO L225 Difference]: With dead ends: 5167 [2024-10-10 23:32:33,275 INFO L226 Difference]: Without dead ends: 5165 [2024-10-10 23:32:33,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:32:33,276 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:33,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:32:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-10 23:32:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 3741. [2024-10-10 23:32:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0954545454545455) internal successors, (4097), 3740 states have internal predecessors, (4097), 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-10 23:32:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4097 transitions. [2024-10-10 23:32:33,307 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4097 transitions. Word has length 586 [2024-10-10 23:32:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:33,308 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4097 transitions. [2024-10-10 23:32:33,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4097 transitions. [2024-10-10 23:32:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-10-10 23:32:33,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:33,312 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2024-10-10 23:32:33,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:32:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 23:32:33,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1638941890, now seen corresponding path program 1 times [2024-10-10 23:32:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:33,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676094397] [2024-10-10 23:32:33,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 908 proven. 2 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2024-10-10 23:32:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676094397] [2024-10-10 23:32:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676094397] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307445570] [2024-10-10 23:32:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:34,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:34,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:34,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:34,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:32:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:34,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:34,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1283 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2024-10-10 23:32:34,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:34,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307445570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:34,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:32:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548729992] [2024-10-10 23:32:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:34,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:34,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:34,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:32:34,496 INFO L87 Difference]: Start difference. First operand 3741 states and 4097 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-10 23:32:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:34,954 INFO L93 Difference]: Finished difference Result 8191 states and 9024 transitions. [2024-10-10 23:32:34,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:34,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 593 [2024-10-10 23:32:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:34,955 INFO L225 Difference]: With dead ends: 8191 [2024-10-10 23:32:34,955 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:32:34,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:32:34,961 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 130 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:34,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 209 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:32:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:32:34,962 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-10 23:32:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:32:34,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 593 [2024-10-10 23:32:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:34,962 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:32:34,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-10 23:32:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:32:34,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:32:34,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:32:34,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 23:32:35,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:32:35,168 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:35,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:32:35,506 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:32:35,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:32:35 BoogieIcfgContainer [2024-10-10 23:32:35,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:32:35,529 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:32:35,529 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:32:35,529 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:32:35,529 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:32:19" (3/4) ... [2024-10-10 23:32:35,531 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:32:35,545 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:32:35,546 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:32:35,547 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:32:35,547 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:32:35,665 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:32:35,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:32:35,666 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:32:35,666 INFO L158 Benchmark]: Toolchain (without parser) took 17797.47ms. Allocated memory was 230.7MB in the beginning and 627.0MB in the end (delta: 396.4MB). Free memory was 161.2MB in the beginning and 485.1MB in the end (delta: -324.0MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,666 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:32:35,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 642.99ms. Allocated memory is still 230.7MB. Free memory was 160.9MB in the beginning and 196.5MB in the end (delta: -35.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.15ms. Allocated memory is still 230.7MB. Free memory was 196.5MB in the beginning and 186.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,667 INFO L158 Benchmark]: Boogie Preprocessor took 127.25ms. Allocated memory is still 230.7MB. Free memory was 186.0MB in the beginning and 173.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,667 INFO L158 Benchmark]: RCFGBuilder took 1113.32ms. Allocated memory is still 230.7MB. Free memory was 173.4MB in the beginning and 173.1MB in the end (delta: 347.2kB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,667 INFO L158 Benchmark]: TraceAbstraction took 15675.85ms. Allocated memory was 230.7MB in the beginning and 627.0MB in the end (delta: 396.4MB). Free memory was 172.0MB in the beginning and 499.8MB in the end (delta: -327.7MB). Peak memory consumption was 352.8MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,668 INFO L158 Benchmark]: Witness Printer took 137.35ms. Allocated memory is still 627.0MB. Free memory was 499.8MB in the beginning and 485.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:32:35,669 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.13ms. Allocated memory is still 115.3MB. Free memory is still 76.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 642.99ms. Allocated memory is still 230.7MB. Free memory was 160.9MB in the beginning and 196.5MB in the end (delta: -35.6MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.15ms. Allocated memory is still 230.7MB. Free memory was 196.5MB in the beginning and 186.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.25ms. Allocated memory is still 230.7MB. Free memory was 186.0MB in the beginning and 173.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1113.32ms. Allocated memory is still 230.7MB. Free memory was 173.4MB in the beginning and 173.1MB in the end (delta: 347.2kB). Peak memory consumption was 110.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15675.85ms. Allocated memory was 230.7MB in the beginning and 627.0MB in the end (delta: 396.4MB). Free memory was 172.0MB in the beginning and 499.8MB in the end (delta: -327.7MB). Peak memory consumption was 352.8MB. Max. memory is 16.1GB. * Witness Printer took 137.35ms. Allocated memory is still 627.0MB. Free memory was 499.8MB in the beginning and 485.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. 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: 197]: 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, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1779 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1779 mSDsluCounter, 1413 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 877 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6854 IncrementalHoareTripleChecker+Invalid, 7731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 877 mSolverCounterUnsat, 1350 mSDtfsCounter, 6854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2652 GetRequests, 2619 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3741occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 3026 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 7418 NumberOfCodeBlocks, 7418 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 7398 ConstructedInterpolants, 0 QuantifiedInterpolants, 25897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3359 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 11453/11996 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((9 <= a21) && (a24 == 1))) || ((a24 == 1) && (12 <= a12))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 7))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:32:35,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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