./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/Problem18_label51.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/Problem18_label51.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 b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:55:03,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:55:03,700 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:55:03,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:55:03,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:55:03,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:55:03,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:55:03,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:55:03,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:55:03,741 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:55:03,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:55:03,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:55:03,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:55:03,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:55:03,744 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:55:03,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:55:03,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:55:03,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:55:03,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:55:03,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:55:03,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:55:03,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:55:03,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:55:03,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:55:03,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:55:03,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:55:03,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:55:03,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:55:03,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:55:03,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:55:03,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:55:03,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:55:03,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:55:03,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:55:03,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:55:03,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:55:03,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:55:03,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:55:03,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:55:03,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:55:03,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:55:03,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:55:03,755 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 -> b09204eec7fef585004b69b471b657e04a2a46cceef0cdf26e228e2dd271c194 [2024-10-10 23:55:04,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:55:04,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:55:04,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:55:04,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:55:04,082 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:55:04,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-10-10 23:55:05,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:55:05,884 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:55:05,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label51.c [2024-10-10 23:55:05,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/578eb8243/3020b78cf00049739b0c0590099be983/FLAG223616cb5 [2024-10-10 23:55:05,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/578eb8243/3020b78cf00049739b0c0590099be983 [2024-10-10 23:55:05,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:55:05,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:55:05,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:55:05,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:55:05,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:55:05,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:55:05" (1/1) ... [2024-10-10 23:55:05,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a186322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:05, skipping insertion in model container [2024-10-10 23:55:05,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:55:05" (1/1) ... [2024-10-10 23:55:06,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:55:06,288 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/Problem18_label51.c[6263,6276] [2024-10-10 23:55:06,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:55:06,875 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:55:06,894 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/Problem18_label51.c[6263,6276] [2024-10-10 23:55:07,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:55:07,163 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:55:07,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07 WrapperNode [2024-10-10 23:55:07,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:55:07,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:55:07,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:55:07,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:55:07,172 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:55:07" (1/1) ... [2024-10-10 23:55:07,223 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:55:07" (1/1) ... [2024-10-10 23:55:07,393 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-10-10 23:55:07,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:55:07,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:55:07,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:55:07,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:55:07,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,598 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:55:07,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:55:07,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:55:07,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:55:07,834 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:55:07,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (1/1) ... [2024-10-10 23:55:07,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:55:07,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:07,868 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:55:07,870 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:55:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:55:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:55:07,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:55:07,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:55:08,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:55:08,048 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:55:11,584 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-10-10 23:55:11,584 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:55:11,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:55:11,650 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:55:11,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:11 BoogieIcfgContainer [2024-10-10 23:55:11,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:55:11,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:55:11,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:55:11,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:55:11,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:55:05" (1/3) ... [2024-10-10 23:55:11,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210ceb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:55:11, skipping insertion in model container [2024-10-10 23:55:11,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:55:07" (2/3) ... [2024-10-10 23:55:11,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210ceb8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:55:11, skipping insertion in model container [2024-10-10 23:55:11,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:11" (3/3) ... [2024-10-10 23:55:11,661 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label51.c [2024-10-10 23:55:11,677 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:55:11,677 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:55:11,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:55:11,774 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;@6f0dc8cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:55:11,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:55:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 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:55:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 23:55:11,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:11,793 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] [2024-10-10 23:55:11,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:11,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1677427773, now seen corresponding path program 1 times [2024-10-10 23:55:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328546264] [2024-10-10 23:55:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:12,015 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:55:12,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:12,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328546264] [2024-10-10 23:55:12,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328546264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:12,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:12,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:12,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724005452] [2024-10-10 23:55:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:12,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:55:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:12,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:55:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:55:12,060 INFO L87 Difference]: Start difference. First operand has 695 states, 693 states have (on average 1.9942279942279941) internal successors, (1382), 694 states have internal predecessors, (1382), 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:55:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:12,165 INFO L93 Difference]: Finished difference Result 1389 states and 2763 transitions. [2024-10-10 23:55:12,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:55:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-10 23:55:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:12,192 INFO L225 Difference]: With dead ends: 1389 [2024-10-10 23:55:12,192 INFO L226 Difference]: Without dead ends: 693 [2024-10-10 23:55:12,201 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:55:12,205 INFO L432 NwaCegarLoop]: 1317 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, 1317 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:55:12,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:55:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-10 23:55:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-10 23:55:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 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:55:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2024-10-10 23:55:12,295 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 59 [2024-10-10 23:55:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:12,296 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2024-10-10 23:55:12,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 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:55:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2024-10-10 23:55:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 23:55:12,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:12,300 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] [2024-10-10 23:55:12,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:55:12,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:12,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:12,301 INFO L85 PathProgramCache]: Analyzing trace with hash 306654237, now seen corresponding path program 1 times [2024-10-10 23:55:12,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:12,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571068110] [2024-10-10 23:55:12,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:12,526 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:55:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:12,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571068110] [2024-10-10 23:55:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571068110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:12,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368260145] [2024-10-10 23:55:12,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:12,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:12,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:12,530 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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:55:15,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:15,342 INFO L93 Difference]: Finished difference Result 2075 states and 3948 transitions. [2024-10-10 23:55:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:15,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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 59 [2024-10-10 23:55:15,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:15,350 INFO L225 Difference]: With dead ends: 2075 [2024-10-10 23:55:15,351 INFO L226 Difference]: Without dead ends: 1383 [2024-10-10 23:55:15,353 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:55:15,354 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 716 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:15,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 435 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-10 23:55:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-10-10 23:55:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1383. [2024-10-10 23:55:15,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1382 states have (on average 1.5998552821997105) internal successors, (2211), 1382 states have internal predecessors, (2211), 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:55:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2211 transitions. [2024-10-10 23:55:15,397 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2211 transitions. Word has length 59 [2024-10-10 23:55:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:15,398 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 2211 transitions. [2024-10-10 23:55:15,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 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:55:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2211 transitions. [2024-10-10 23:55:15,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-10 23:55:15,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:15,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:15,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:55:15,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:15,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:15,425 INFO L85 PathProgramCache]: Analyzing trace with hash -710014281, now seen corresponding path program 1 times [2024-10-10 23:55:15,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:15,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203407972] [2024-10-10 23:55:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:15,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:15,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203407972] [2024-10-10 23:55:15,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203407972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:15,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:15,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386181563] [2024-10-10 23:55:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:15,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:15,635 INFO L87 Difference]: Start difference. First operand 1383 states and 2211 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:55:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:18,494 INFO L93 Difference]: Finished difference Result 4145 states and 6630 transitions. [2024-10-10 23:55:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:18,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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 124 [2024-10-10 23:55:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:18,506 INFO L225 Difference]: With dead ends: 4145 [2024-10-10 23:55:18,507 INFO L226 Difference]: Without dead ends: 2763 [2024-10-10 23:55:18,510 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:55:18,513 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:18,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 527 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:55:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2024-10-10 23:55:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2763. [2024-10-10 23:55:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2763 states, 2762 states have (on average 1.3504706734250542) internal successors, (3730), 2762 states have internal predecessors, (3730), 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:55:18,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2763 states to 2763 states and 3730 transitions. [2024-10-10 23:55:18,598 INFO L78 Accepts]: Start accepts. Automaton has 2763 states and 3730 transitions. Word has length 124 [2024-10-10 23:55:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:18,600 INFO L471 AbstractCegarLoop]: Abstraction has 2763 states and 3730 transitions. [2024-10-10 23:55:18,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 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:55:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2763 states and 3730 transitions. [2024-10-10 23:55:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-10-10 23:55:18,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:18,610 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:18,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:55:18,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:18,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:18,611 INFO L85 PathProgramCache]: Analyzing trace with hash -146279344, now seen corresponding path program 1 times [2024-10-10 23:55:18,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:18,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742152093] [2024-10-10 23:55:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:18,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:55:19,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742152093] [2024-10-10 23:55:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742152093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:19,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348256185] [2024-10-10 23:55:19,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:19,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:55:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:19,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:55:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:55:19,206 INFO L87 Difference]: Start difference. First operand 2763 states and 3730 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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:55:22,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:22,542 INFO L93 Difference]: Finished difference Result 6905 states and 9073 transitions. [2024-10-10 23:55:22,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:55:22,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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 242 [2024-10-10 23:55:22,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:22,558 INFO L225 Difference]: With dead ends: 6905 [2024-10-10 23:55:22,558 INFO L226 Difference]: Without dead ends: 4143 [2024-10-10 23:55:22,562 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:55:22,565 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 4275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:22,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 638 Invalid, 4275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-10 23:55:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2024-10-10 23:55:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4143. [2024-10-10 23:55:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.2467407049734427) internal successors, (5164), 4142 states have internal predecessors, (5164), 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:55:22,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5164 transitions. [2024-10-10 23:55:22,644 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5164 transitions. Word has length 242 [2024-10-10 23:55:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:22,645 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5164 transitions. [2024-10-10 23:55:22,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 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:55:22,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5164 transitions. [2024-10-10 23:55:22,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-10-10 23:55:22,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:22,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:55:22,653 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:22,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash -824439251, now seen corresponding path program 1 times [2024-10-10 23:55:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430439171] [2024-10-10 23:55:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 23:55:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:23,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430439171] [2024-10-10 23:55:23,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430439171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436757546] [2024-10-10 23:55:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:23,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:23,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:23,215 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:55:23,216 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:55:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:23,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:23,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-10 23:55:23,825 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:23,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436757546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:23,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:23,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:55:23,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772187950] [2024-10-10 23:55:23,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:23,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:23,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:23,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:23,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:55:23,828 INFO L87 Difference]: Start difference. First operand 4143 states and 5164 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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:55:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:26,092 INFO L93 Difference]: Finished difference Result 11045 states and 14055 transitions. [2024-10-10 23:55:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:26,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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 358 [2024-10-10 23:55:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:26,118 INFO L225 Difference]: With dead ends: 11045 [2024-10-10 23:55:26,119 INFO L226 Difference]: Without dead ends: 6903 [2024-10-10 23:55:26,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 357 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:55:26,130 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:26,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 548 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:55:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2024-10-10 23:55:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6213. [2024-10-10 23:55:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6212 states have (on average 1.2398583386992916) internal successors, (7702), 6212 states have internal predecessors, (7702), 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:55:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 7702 transitions. [2024-10-10 23:55:26,241 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 7702 transitions. Word has length 358 [2024-10-10 23:55:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:26,246 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 7702 transitions. [2024-10-10 23:55:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 2 states have internal predecessors, (302), 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:55:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 7702 transitions. [2024-10-10 23:55:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-10 23:55:26,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:26,253 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:55:26,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:26,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:26,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1953913407, now seen corresponding path program 1 times [2024-10-10 23:55:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:26,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883903920] [2024-10-10 23:55:26,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:26,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-10-10 23:55:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883903920] [2024-10-10 23:55:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883903920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138502671] [2024-10-10 23:55:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:55:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:26,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:55:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:55:26,988 INFO L87 Difference]: Start difference. First operand 6213 states and 7702 transitions. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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:55:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:29,247 INFO L93 Difference]: Finished difference Result 13858 states and 16878 transitions. [2024-10-10 23:55:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:55:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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 428 [2024-10-10 23:55:29,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:29,268 INFO L225 Difference]: With dead ends: 13858 [2024-10-10 23:55:29,268 INFO L226 Difference]: Without dead ends: 7593 [2024-10-10 23:55:29,277 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:55:29,279 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 529 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:29,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 634 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:55:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7593 states. [2024-10-10 23:55:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7593 to 7593. [2024-10-10 23:55:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7593 states, 7592 states have (on average 1.1513435194942043) internal successors, (8741), 7592 states have internal predecessors, (8741), 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:55:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7593 states to 7593 states and 8741 transitions. [2024-10-10 23:55:29,422 INFO L78 Accepts]: Start accepts. Automaton has 7593 states and 8741 transitions. Word has length 428 [2024-10-10 23:55:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:29,423 INFO L471 AbstractCegarLoop]: Abstraction has 7593 states and 8741 transitions. [2024-10-10 23:55:29,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 3 states have internal predecessors, (354), 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:55:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7593 states and 8741 transitions. [2024-10-10 23:55:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2024-10-10 23:55:29,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:29,432 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:29,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:55:29,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:29,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:29,433 INFO L85 PathProgramCache]: Analyzing trace with hash -558695947, now seen corresponding path program 1 times [2024-10-10 23:55:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:29,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390039199] [2024-10-10 23:55:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:29,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-10 23:55:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390039199] [2024-10-10 23:55:29,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390039199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:55:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361294840] [2024-10-10 23:55:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:29,917 INFO L87 Difference]: Start difference. First operand 7593 states and 8741 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 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:55:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:31,748 INFO L93 Difference]: Finished difference Result 18635 states and 21310 transitions. [2024-10-10 23:55:31,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:31,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 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) Word has length 443 [2024-10-10 23:55:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:31,774 INFO L225 Difference]: With dead ends: 18635 [2024-10-10 23:55:31,774 INFO L226 Difference]: Without dead ends: 11043 [2024-10-10 23:55:31,784 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:55:31,785 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 424 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:55:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11043 states. [2024-10-10 23:55:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11043 to 11043. [2024-10-10 23:55:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11043 states, 11042 states have (on average 1.1249773591740626) internal successors, (12422), 11042 states have internal predecessors, (12422), 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:55:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 12422 transitions. [2024-10-10 23:55:31,963 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 12422 transitions. Word has length 443 [2024-10-10 23:55:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:31,964 INFO L471 AbstractCegarLoop]: Abstraction has 11043 states and 12422 transitions. [2024-10-10 23:55:31,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 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:55:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 12422 transitions. [2024-10-10 23:55:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2024-10-10 23:55:31,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:31,972 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:55:31,973 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:31,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:31,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1535278305, now seen corresponding path program 1 times [2024-10-10 23:55:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:31,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418082552] [2024-10-10 23:55:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:55:32,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:32,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418082552] [2024-10-10 23:55:32,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418082552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:32,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:32,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:32,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188545639] [2024-10-10 23:55:32,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:32,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:32,607 INFO L87 Difference]: Start difference. First operand 11043 states and 12422 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:55:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:34,537 INFO L93 Difference]: Finished difference Result 30365 states and 34441 transitions. [2024-10-10 23:55:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 451 [2024-10-10 23:55:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:34,571 INFO L225 Difference]: With dead ends: 30365 [2024-10-10 23:55:34,572 INFO L226 Difference]: Without dead ends: 19323 [2024-10-10 23:55:34,584 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:55:34,585 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 601 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1956 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:34,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 975 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1956 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:55:34,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19323 states. [2024-10-10 23:55:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19323 to 18633. [2024-10-10 23:55:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18633 states, 18632 states have (on average 1.1019214255045084) internal successors, (20531), 18632 states have internal predecessors, (20531), 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:55:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18633 states to 18633 states and 20531 transitions. [2024-10-10 23:55:34,911 INFO L78 Accepts]: Start accepts. Automaton has 18633 states and 20531 transitions. Word has length 451 [2024-10-10 23:55:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:34,911 INFO L471 AbstractCegarLoop]: Abstraction has 18633 states and 20531 transitions. [2024-10-10 23:55:34,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:55:34,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18633 states and 20531 transitions. [2024-10-10 23:55:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2024-10-10 23:55:34,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:34,920 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:55:34,920 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:34,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:34,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1101784290, now seen corresponding path program 1 times [2024-10-10 23:55:34,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:34,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651041647] [2024-10-10 23:55:34,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:34,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-10 23:55:35,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:35,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651041647] [2024-10-10 23:55:35,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651041647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:35,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:35,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:35,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881151141] [2024-10-10 23:55:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:35,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:35,203 INFO L87 Difference]: Start difference. First operand 18633 states and 20531 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:55:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:37,255 INFO L93 Difference]: Finished difference Result 43475 states and 48493 transitions. [2024-10-10 23:55:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 458 [2024-10-10 23:55:37,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:37,301 INFO L225 Difference]: With dead ends: 43475 [2024-10-10 23:55:37,301 INFO L226 Difference]: Without dead ends: 25533 [2024-10-10 23:55:37,318 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:55:37,319 INFO L432 NwaCegarLoop]: 1146 mSDtfsCounter, 633 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:37,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1152 Invalid, 2368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1889 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:55:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25533 states. [2024-10-10 23:55:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25533 to 24843. [2024-10-10 23:55:37,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.094597858465502) internal successors, (27192), 24842 states have internal predecessors, (27192), 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:55:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 27192 transitions. [2024-10-10 23:55:37,636 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 27192 transitions. Word has length 458 [2024-10-10 23:55:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:37,637 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 27192 transitions. [2024-10-10 23:55:37,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:55:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 27192 transitions. [2024-10-10 23:55:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-10-10 23:55:37,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:37,642 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:37,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:55:37,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash -195819049, now seen corresponding path program 1 times [2024-10-10 23:55:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900167613] [2024-10-10 23:55:37,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:37,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:55:38,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:38,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900167613] [2024-10-10 23:55:38,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900167613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:38,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:38,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:38,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11124512] [2024-10-10 23:55:38,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:38,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:38,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:38,481 INFO L87 Difference]: Start difference. First operand 24843 states and 27192 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:55:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:40,317 INFO L93 Difference]: Finished difference Result 48995 states and 53690 transitions. [2024-10-10 23:55:40,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:40,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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 483 [2024-10-10 23:55:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:40,360 INFO L225 Difference]: With dead ends: 48995 [2024-10-10 23:55:40,360 INFO L226 Difference]: Without dead ends: 24843 [2024-10-10 23:55:40,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:55:40,386 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 737 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:40,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 777 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:55:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24843 states. [2024-10-10 23:55:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24843 to 24843. [2024-10-10 23:55:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24843 states, 24842 states have (on average 1.0762418484824088) internal successors, (26736), 24842 states have internal predecessors, (26736), 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:55:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24843 states to 24843 states and 26736 transitions. [2024-10-10 23:55:40,758 INFO L78 Accepts]: Start accepts. Automaton has 24843 states and 26736 transitions. Word has length 483 [2024-10-10 23:55:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:40,759 INFO L471 AbstractCegarLoop]: Abstraction has 24843 states and 26736 transitions. [2024-10-10 23:55:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 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:55:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24843 states and 26736 transitions. [2024-10-10 23:55:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2024-10-10 23:55:40,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:40,769 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:55:40,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:40,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2135173432, now seen corresponding path program 1 times [2024-10-10 23:55:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:40,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171912942] [2024-10-10 23:55:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:40,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-10 23:55:41,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171912942] [2024-10-10 23:55:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171912942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:55:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:55:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774758318] [2024-10-10 23:55:41,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:41,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:41,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:55:41,168 INFO L87 Difference]: Start difference. First operand 24843 states and 26736 transitions. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:55:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:43,151 INFO L93 Difference]: Finished difference Result 55205 states and 60039 transitions. [2024-10-10 23:55:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:43,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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 601 [2024-10-10 23:55:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:43,200 INFO L225 Difference]: With dead ends: 55205 [2024-10-10 23:55:43,200 INFO L226 Difference]: Without dead ends: 28293 [2024-10-10 23:55:43,220 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:55:43,221 INFO L432 NwaCegarLoop]: 1088 mSDtfsCounter, 609 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:43,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1094 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:55:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28293 states. [2024-10-10 23:55:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28293 to 28293. [2024-10-10 23:55:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28293 states, 28292 states have (on average 1.0739431641453414) internal successors, (30384), 28292 states have internal predecessors, (30384), 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:55:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 30384 transitions. [2024-10-10 23:55:43,663 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 30384 transitions. Word has length 601 [2024-10-10 23:55:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:43,664 INFO L471 AbstractCegarLoop]: Abstraction has 28293 states and 30384 transitions. [2024-10-10 23:55:43,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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:55:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 30384 transitions. [2024-10-10 23:55:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-10-10 23:55:43,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:43,679 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:43,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:55:43,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:43,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:43,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1501464110, now seen corresponding path program 1 times [2024-10-10 23:55:43,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:43,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574113865] [2024-10-10 23:55:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 533 proven. 32 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:55:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574113865] [2024-10-10 23:55:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574113865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283839125] [2024-10-10 23:55:44,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:44,415 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:55:44,416 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:55:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:44,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:44,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-10-10 23:55:44,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283839125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:55:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766044156] [2024-10-10 23:55:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:44,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:55:44,707 INFO L87 Difference]: Start difference. First operand 28293 states and 30384 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:55:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:46,678 INFO L93 Difference]: Finished difference Result 62105 states and 67212 transitions. [2024-10-10 23:55:46,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:46,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 637 [2024-10-10 23:55:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:46,721 INFO L225 Difference]: With dead ends: 62105 [2024-10-10 23:55:46,721 INFO L226 Difference]: Without dead ends: 33813 [2024-10-10 23:55:46,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 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:55:46,745 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 643 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:46,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1001 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:55:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33813 states. [2024-10-10 23:55:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33813 to 32433. [2024-10-10 23:55:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32433 states, 32432 states have (on average 1.0797360631475086) internal successors, (35018), 32432 states have internal predecessors, (35018), 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:55:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32433 states to 32433 states and 35018 transitions. [2024-10-10 23:55:47,132 INFO L78 Accepts]: Start accepts. Automaton has 32433 states and 35018 transitions. Word has length 637 [2024-10-10 23:55:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:47,132 INFO L471 AbstractCegarLoop]: Abstraction has 32433 states and 35018 transitions. [2024-10-10 23:55:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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:55:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32433 states and 35018 transitions. [2024-10-10 23:55:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2024-10-10 23:55:47,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:47,167 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,187 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:55:47,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:47,369 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:47,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:47,369 INFO L85 PathProgramCache]: Analyzing trace with hash 255316216, now seen corresponding path program 1 times [2024-10-10 23:55:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:47,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969423168] [2024-10-10 23:55:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:47,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 538 proven. 117 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-10 23:55:49,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969423168] [2024-10-10 23:55:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969423168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124906821] [2024-10-10 23:55:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:49,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:49,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:49,456 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:55:49,457 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:55:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:49,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:49,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-10 23:55:50,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124906821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:50,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:50,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:55:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672601076] [2024-10-10 23:55:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:50,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:55:50,200 INFO L87 Difference]: Start difference. First operand 32433 states and 35018 transitions. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:55:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:52,162 INFO L93 Difference]: Finished difference Result 75215 states and 82020 transitions. [2024-10-10 23:55:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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 912 [2024-10-10 23:55:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:52,207 INFO L225 Difference]: With dead ends: 75215 [2024-10-10 23:55:52,207 INFO L226 Difference]: Without dead ends: 43473 [2024-10-10 23:55:52,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 916 GetRequests, 911 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:55:52,226 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 341 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:52,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 218 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:55:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-10 23:55:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-10 23:55:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0783262789841737) internal successors, (46877), 43472 states have internal predecessors, (46877), 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:55:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 46877 transitions. [2024-10-10 23:55:52,743 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 46877 transitions. Word has length 912 [2024-10-10 23:55:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:52,743 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 46877 transitions. [2024-10-10 23:55:52,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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:55:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 46877 transitions. [2024-10-10 23:55:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 938 [2024-10-10 23:55:52,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:52,774 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:52,790 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:55:52,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:52,975 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:52,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -819196692, now seen corresponding path program 1 times [2024-10-10 23:55:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407188664] [2024-10-10 23:55:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 789 proven. 32 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-10 23:55:54,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:54,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407188664] [2024-10-10 23:55:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407188664] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:54,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298374731] [2024-10-10 23:55:54,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:54,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:54,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:54,067 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:55:54,069 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:55:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:54,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:54,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-10 23:55:54,771 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298374731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:54,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:55:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102032405] [2024-10-10 23:55:54,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:54,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:55:54,774 INFO L87 Difference]: Start difference. First operand 43473 states and 46877 transitions. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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:55:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:55:56,597 INFO L93 Difference]: Finished difference Result 86255 states and 93060 transitions. [2024-10-10 23:55:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:55:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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 937 [2024-10-10 23:55:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:55:56,649 INFO L225 Difference]: With dead ends: 86255 [2024-10-10 23:55:56,649 INFO L226 Difference]: Without dead ends: 43473 [2024-10-10 23:55:56,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 937 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:55:56,679 INFO L432 NwaCegarLoop]: 983 mSDtfsCounter, 374 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:55:56,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 989 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:55:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43473 states. [2024-10-10 23:55:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43473 to 43473. [2024-10-10 23:55:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43473 states, 43472 states have (on average 1.0546788737578212) internal successors, (45849), 43472 states have internal predecessors, (45849), 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:55:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 45849 transitions. [2024-10-10 23:55:57,216 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 45849 transitions. Word has length 937 [2024-10-10 23:55:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:55:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 43473 states and 45849 transitions. [2024-10-10 23:55:57,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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:55:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 45849 transitions. [2024-10-10 23:55:57,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2024-10-10 23:55:57,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:55:57,239 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:55:57,253 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:55:57,440 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,SelfDestructingSolverStorable13 [2024-10-10 23:55:57,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:55:57,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:55:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 317429536, now seen corresponding path program 1 times [2024-10-10 23:55:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:55:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897453974] [2024-10-10 23:55:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:55:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 726 proven. 92 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2024-10-10 23:55:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:55:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897453974] [2024-10-10 23:55:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897453974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:55:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659245204] [2024-10-10 23:55:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:55:59,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:55:59,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:55:59,044 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:55:59,046 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:55:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:55:59,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:55:59,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:55:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-10-10 23:55:59,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:55:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659245204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:55:59,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:55:59,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:55:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995335030] [2024-10-10 23:55:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:55:59,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:55:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:55:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:55:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:55:59,691 INFO L87 Difference]: Start difference. First operand 43473 states and 45849 transitions. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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:56:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:01,616 INFO L93 Difference]: Finished difference Result 97295 states and 103205 transitions. [2024-10-10 23:56:01,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:56:01,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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 963 [2024-10-10 23:56:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:01,821 INFO L225 Difference]: With dead ends: 97295 [2024-10-10 23:56:01,822 INFO L226 Difference]: Without dead ends: 49683 [2024-10-10 23:56:01,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:56:01,843 INFO L432 NwaCegarLoop]: 1045 mSDtfsCounter, 337 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:01,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1051 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:56:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49683 states. [2024-10-10 23:56:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49683 to 47613. [2024-10-10 23:56:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47613 states, 47612 states have (on average 1.033016886499202) internal successors, (49184), 47612 states have internal predecessors, (49184), 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:56:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47613 states to 47613 states and 49184 transitions. [2024-10-10 23:56:02,375 INFO L78 Accepts]: Start accepts. Automaton has 47613 states and 49184 transitions. Word has length 963 [2024-10-10 23:56:02,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:02,375 INFO L471 AbstractCegarLoop]: Abstraction has 47613 states and 49184 transitions. [2024-10-10 23:56:02,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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:56:02,376 INFO L276 IsEmpty]: Start isEmpty. Operand 47613 states and 49184 transitions. [2024-10-10 23:56:02,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1010 [2024-10-10 23:56:02,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:56:02,403 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:02,416 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:56:02,603 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,SelfDestructingSolverStorable14 [2024-10-10 23:56:02,604 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:56:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:56:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -153115856, now seen corresponding path program 1 times [2024-10-10 23:56:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:56:02,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54267621] [2024-10-10 23:56:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:56:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:56:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:56:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1231 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 941 trivial. 0 not checked. [2024-10-10 23:56:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:56:03,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54267621] [2024-10-10 23:56:03,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54267621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:56:03,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:56:03,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:56:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226601030] [2024-10-10 23:56:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:56:03,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:56:03,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:56:03,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:56:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:56:03,368 INFO L87 Difference]: Start difference. First operand 47613 states and 49184 transitions. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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:56:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:56:05,181 INFO L93 Difference]: Finished difference Result 93843 states and 96948 transitions. [2024-10-10 23:56:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:56:05,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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 1009 [2024-10-10 23:56:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:56:05,183 INFO L225 Difference]: With dead ends: 93843 [2024-10-10 23:56:05,183 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:56:05,210 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:56:05,211 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 635 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:56:05,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 263 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:56:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:56:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:56:05,212 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:56:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:56:05,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1009 [2024-10-10 23:56:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:56:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:56:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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:56:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:56:05,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:56:05,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:56:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:56:05,221 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:56:05,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:56:05,932 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:56:05,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:56:05 BoogieIcfgContainer [2024-10-10 23:56:05,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:56:05,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:56:05,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:56:05,948 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:56:05,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:55:11" (3/4) ... [2024-10-10 23:56:05,950 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:56:06,000 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-10 23:56:06,005 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:56:06,010 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:56:06,014 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:56:06,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:56:06,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:56:06,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:56:06,325 INFO L158 Benchmark]: Toolchain (without parser) took 60383.47ms. Allocated memory was 161.5MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 104.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 903.7MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,326 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:56:06,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1218.79ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 63.9MB in the end (delta: 40.5MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 228.50ms. Allocated memory is still 161.5MB. Free memory was 63.9MB in the beginning and 82.7MB in the end (delta: -18.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,326 INFO L158 Benchmark]: Boogie Preprocessor took 436.36ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 82.7MB in the beginning and 147.9MB in the end (delta: -65.1MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,327 INFO L158 Benchmark]: RCFGBuilder took 3817.96ms. Allocated memory was 232.8MB in the beginning and 423.6MB in the end (delta: 190.8MB). Free memory was 147.9MB in the beginning and 233.2MB in the end (delta: -85.4MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,327 INFO L158 Benchmark]: TraceAbstraction took 54291.29ms. Allocated memory was 423.6MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 232.2MB in the beginning and 1.2GB in the end (delta: -960.0MB). Peak memory consumption was 714.5MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,327 INFO L158 Benchmark]: Witness Printer took 379.55ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-10 23:56:06,329 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.41ms. Allocated memory is still 100.7MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1218.79ms. Allocated memory is still 161.5MB. Free memory was 104.5MB in the beginning and 63.9MB in the end (delta: 40.5MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 228.50ms. Allocated memory is still 161.5MB. Free memory was 63.9MB in the beginning and 82.7MB in the end (delta: -18.8MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 436.36ms. Allocated memory was 161.5MB in the beginning and 232.8MB in the end (delta: 71.3MB). Free memory was 82.7MB in the beginning and 147.9MB in the end (delta: -65.1MB). Peak memory consumption was 64.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3817.96ms. Allocated memory was 232.8MB in the beginning and 423.6MB in the end (delta: 190.8MB). Free memory was 147.9MB in the beginning and 233.2MB in the end (delta: -85.4MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54291.29ms. Allocated memory was 423.6MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 232.2MB in the beginning and 1.2GB in the end (delta: -960.0MB). Peak memory consumption was 714.5MB. Max. memory is 16.1GB. * Witness Printer took 379.55ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 55.6MB). Peak memory consumption was 54.5MB. 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: 199]: 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, 695 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9538 SdHoareTripleChecker+Valid, 30.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9538 mSDsluCounter, 12043 SdHoareTripleChecker+Invalid, 24.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 6050 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31538 IncrementalHoareTripleChecker+Invalid, 37588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6050 mSolverCounterUnsat, 11941 mSDtfsCounter, 31538 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3857 GetRequests, 3825 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47613occurred in iteration=15, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 5520 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 11971 NumberOfCodeBlocks, 11971 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 11950 ConstructedInterpolants, 0 QuantifiedInterpolants, 27109 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4490 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 10174/10488 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: 4269]: Loop Invariant Derived loop invariant: ((((((((a24 <= 0) || (3 <= a24)) || (a24 == 1)) || (a18 <= 8)) || (a15 != 4)) || (11 <= a18)) || (a18 == 9)) || (a3 <= 99)) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:56:06,360 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