./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/Problem02_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:19:05,603 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:19:05,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:19:05,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:19:05,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:19:05,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:19:05,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:19:05,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:19:05,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:19:05,701 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:19:05,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:19:05,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:19:05,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:19:05,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:19:05,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:19:05,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:19:05,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:19:05,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:19:05,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:19:05,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:19:05,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:19:05,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:19:05,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:19:05,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:19:05,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:19:05,705 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:19:05,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:19:05,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:19:05,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:19:05,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:19:05,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:19:05,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:19:05,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:19:05,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:19:05,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:19:05,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:19:05,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:19:05,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:19:05,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:19:05,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:19:05,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:19:05,709 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:19:05,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f [2024-10-23 20:19:05,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:19:05,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:19:05,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:19:05,896 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:19:05,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:19:05,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2024-10-23 20:19:07,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:19:07,500 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:19:07,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2024-10-23 20:19:07,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2e6e4ab/4ec712a24e1040d3af53c8b2c3408579/FLAG5d1d08e3b [2024-10-23 20:19:07,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c2e6e4ab/4ec712a24e1040d3af53c8b2c3408579 [2024-10-23 20:19:07,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:19:07,873 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:19:07,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:19:07,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:19:07,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:19:07,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:19:07" (1/1) ... [2024-10-23 20:19:07,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ab6bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:07, skipping insertion in model container [2024-10-23 20:19:07,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:19:07" (1/1) ... [2024-10-23 20:19:07,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:19:08,182 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/Problem02_label19.c[15877,15890] [2024-10-23 20:19:08,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:19:08,245 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:19:08,372 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/Problem02_label19.c[15877,15890] [2024-10-23 20:19:08,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:19:08,437 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:19:08,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08 WrapperNode [2024-10-23 20:19:08,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:19:08,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:19:08,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:19:08,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:19:08,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,563 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-23 20:19:08,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:19:08,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:19:08,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:19:08,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:19:08,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,650 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-23 20:19:08,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:19:08,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:19:08,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:19:08,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:19:08,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (1/1) ... [2024-10-23 20:19:08,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:19:08,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:19:08,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:19:08,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:19:08,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:19:08,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:19:08,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:19:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:19:08,941 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:19:08,942 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:19:09,540 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-23 20:19:09,543 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:19:09,586 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:19:09,588 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:19:09,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:09 BoogieIcfgContainer [2024-10-23 20:19:09,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:19:09,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:19:09,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:19:09,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:19:09,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:19:07" (1/3) ... [2024-10-23 20:19:09,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f247ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:19:09, skipping insertion in model container [2024-10-23 20:19:09,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:19:08" (2/3) ... [2024-10-23 20:19:09,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f247ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:19:09, skipping insertion in model container [2024-10-23 20:19:09,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:09" (3/3) ... [2024-10-23 20:19:09,596 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2024-10-23 20:19:09,607 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:19:09,607 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:19:09,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:19:09,663 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;@14c004b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:19:09,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:19:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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-23 20:19:09,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-23 20:19:09,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:09,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:19:09,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -536617483, now seen corresponding path program 1 times [2024-10-23 20:19:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:09,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540034866] [2024-10-23 20:19:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:10,070 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-23 20:19:10,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:10,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540034866] [2024-10-23 20:19:10,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540034866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:10,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:10,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994900042] [2024-10-23 20:19:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:10,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:19:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:19:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:19:10,102 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 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 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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-23 20:19:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:10,127 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-23 20:19:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:19:10,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-10-23 20:19:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:10,136 INFO L225 Difference]: With dead ends: 329 [2024-10-23 20:19:10,136 INFO L226 Difference]: Without dead ends: 163 [2024-10-23 20:19:10,138 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-23 20:19:10,141 INFO L432 NwaCegarLoop]: 248 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, 248 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-23 20:19:10,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:19:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-23 20:19:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-23 20:19:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-23 20:19:10,215 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 91 [2024-10-23 20:19:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-23 20:19:10,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 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-23 20:19:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-23 20:19:10,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-23 20:19:10,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:10,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:19:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:19:10,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1189519379, now seen corresponding path program 1 times [2024-10-23 20:19:10,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:10,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182381129] [2024-10-23 20:19:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:10,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:10,441 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-23 20:19:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:10,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182381129] [2024-10-23 20:19:10,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182381129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:10,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:10,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995201378] [2024-10-23 20:19:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:10,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:10,448 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-23 20:19:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:10,915 INFO L93 Difference]: Finished difference Result 466 states and 712 transitions. [2024-10-23 20:19:10,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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 91 [2024-10-23 20:19:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:10,918 INFO L225 Difference]: With dead ends: 466 [2024-10-23 20:19:10,918 INFO L226 Difference]: Without dead ends: 304 [2024-10-23 20:19:10,919 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-23 20:19:10,924 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 128 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:10,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:19:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-23 20:19:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-10-23 20:19:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.528052805280528) internal successors, (463), 303 states have internal predecessors, (463), 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-23 20:19:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 463 transitions. [2024-10-23 20:19:10,956 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 463 transitions. Word has length 91 [2024-10-23 20:19:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:10,957 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 463 transitions. [2024-10-23 20:19:10,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 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-23 20:19:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 463 transitions. [2024-10-23 20:19:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-23 20:19:10,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:10,962 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 20:19:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:19:10,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:10,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 28907961, now seen corresponding path program 1 times [2024-10-23 20:19:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:10,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226542409] [2024-10-23 20:19:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:10,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:11,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226542409] [2024-10-23 20:19:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226542409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313051960] [2024-10-23 20:19:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:11,184 INFO L87 Difference]: Start difference. First operand 304 states and 463 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-23 20:19:11,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:11,674 INFO L93 Difference]: Finished difference Result 901 states and 1374 transitions. [2024-10-23 20:19:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:11,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 102 [2024-10-23 20:19:11,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:11,677 INFO L225 Difference]: With dead ends: 901 [2024-10-23 20:19:11,677 INFO L226 Difference]: Without dead ends: 598 [2024-10-23 20:19:11,678 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-23 20:19:11,679 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:11,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 69 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:19:11,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-23 20:19:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2024-10-23 20:19:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.4781144781144782) internal successors, (878), 594 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 878 transitions. [2024-10-23 20:19:11,694 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 878 transitions. Word has length 102 [2024-10-23 20:19:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:11,694 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 878 transitions. [2024-10-23 20:19:11,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-23 20:19:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 878 transitions. [2024-10-23 20:19:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-23 20:19:11,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:11,699 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 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-23 20:19:11,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:19:11,699 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:11,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1490140178, now seen corresponding path program 1 times [2024-10-23 20:19:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:11,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667466715] [2024-10-23 20:19:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 20:19:11,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667466715] [2024-10-23 20:19:11,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667466715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:11,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:11,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203036825] [2024-10-23 20:19:11,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:11,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:11,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:11,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:11,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:11,894 INFO L87 Difference]: Start difference. First operand 595 states and 878 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-23 20:19:12,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:12,374 INFO L93 Difference]: Finished difference Result 1614 states and 2395 transitions. [2024-10-23 20:19:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:12,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 106 [2024-10-23 20:19:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:12,377 INFO L225 Difference]: With dead ends: 1614 [2024-10-23 20:19:12,377 INFO L226 Difference]: Without dead ends: 1020 [2024-10-23 20:19:12,381 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-23 20:19:12,385 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:12,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 119 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:19:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2024-10-23 20:19:12,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 878. [2024-10-23 20:19:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 1.3523375142531358) internal successors, (1186), 877 states have internal predecessors, (1186), 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-23 20:19:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1186 transitions. [2024-10-23 20:19:12,417 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1186 transitions. Word has length 106 [2024-10-23 20:19:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:12,417 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1186 transitions. [2024-10-23 20:19:12,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-23 20:19:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1186 transitions. [2024-10-23 20:19:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-23 20:19:12,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:12,422 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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-23 20:19:12,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:19:12,422 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:12,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 205812595, now seen corresponding path program 1 times [2024-10-23 20:19:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:12,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368202464] [2024-10-23 20:19:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 20:19:12,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368202464] [2024-10-23 20:19:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368202464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:12,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873134620] [2024-10-23 20:19:12,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:12,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:12,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:12,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:12,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:12,566 INFO L87 Difference]: Start difference. First operand 878 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-23 20:19:12,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:12,934 INFO L93 Difference]: Finished difference Result 2179 states and 3008 transitions. [2024-10-23 20:19:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 111 [2024-10-23 20:19:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:12,939 INFO L225 Difference]: With dead ends: 2179 [2024-10-23 20:19:12,939 INFO L226 Difference]: Without dead ends: 1302 [2024-10-23 20:19:12,940 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-23 20:19:12,941 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:12,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 249 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2024-10-23 20:19:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1161. [2024-10-23 20:19:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1160 states have (on average 1.2922413793103449) internal successors, (1499), 1160 states have internal predecessors, (1499), 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-23 20:19:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1499 transitions. [2024-10-23 20:19:12,983 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1499 transitions. Word has length 111 [2024-10-23 20:19:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:12,984 INFO L471 AbstractCegarLoop]: Abstraction has 1161 states and 1499 transitions. [2024-10-23 20:19:12,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-23 20:19:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1499 transitions. [2024-10-23 20:19:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-23 20:19:12,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:12,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:19:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:19:12,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1124109635, now seen corresponding path program 1 times [2024-10-23 20:19:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847492205] [2024-10-23 20:19:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:12,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 20:19:13,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:13,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847492205] [2024-10-23 20:19:13,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847492205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:13,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:13,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373192534] [2024-10-23 20:19:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:13,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:13,048 INFO L87 Difference]: Start difference. First operand 1161 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-23 20:19:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:13,423 INFO L93 Difference]: Finished difference Result 3302 states and 4290 transitions. [2024-10-23 20:19:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:13,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2024-10-23 20:19:13,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:13,430 INFO L225 Difference]: With dead ends: 3302 [2024-10-23 20:19:13,431 INFO L226 Difference]: Without dead ends: 2142 [2024-10-23 20:19:13,432 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-23 20:19:13,433 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 190 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:13,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 73 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2024-10-23 20:19:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 2142. [2024-10-23 20:19:13,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.2475478748248483) internal successors, (2671), 2141 states have internal predecessors, (2671), 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-23 20:19:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2671 transitions. [2024-10-23 20:19:13,469 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2671 transitions. Word has length 112 [2024-10-23 20:19:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:13,469 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2671 transitions. [2024-10-23 20:19:13,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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-23 20:19:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2671 transitions. [2024-10-23 20:19:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-23 20:19:13,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:13,472 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:19:13,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:19:13,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:13,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1198022717, now seen corresponding path program 1 times [2024-10-23 20:19:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726962895] [2024-10-23 20:19:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-23 20:19:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726962895] [2024-10-23 20:19:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726962895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250077482] [2024-10-23 20:19:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:13,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:13,578 INFO L87 Difference]: Start difference. First operand 2142 states and 2671 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-23 20:19:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:13,947 INFO L93 Difference]: Finished difference Result 4984 states and 6183 transitions. [2024-10-23 20:19:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:13,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 115 [2024-10-23 20:19:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:13,954 INFO L225 Difference]: With dead ends: 4984 [2024-10-23 20:19:13,954 INFO L226 Difference]: Without dead ends: 2843 [2024-10-23 20:19:13,956 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-23 20:19:13,957 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:13,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 265 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2024-10-23 20:19:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2702. [2024-10-23 20:19:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.2054794520547945) internal successors, (3256), 2701 states have internal predecessors, (3256), 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-23 20:19:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3256 transitions. [2024-10-23 20:19:13,991 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3256 transitions. Word has length 115 [2024-10-23 20:19:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:13,991 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 3256 transitions. [2024-10-23 20:19:13,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-23 20:19:13,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3256 transitions. [2024-10-23 20:19:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-23 20:19:13,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:13,994 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:19:13,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:19:13,994 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:13,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -959237945, now seen corresponding path program 1 times [2024-10-23 20:19:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:13,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258237459] [2024-10-23 20:19:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:19:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258237459] [2024-10-23 20:19:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258237459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:14,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544248894] [2024-10-23 20:19:14,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:14,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:14,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:14,067 INFO L87 Difference]: Start difference. First operand 2702 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-23 20:19:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:14,509 INFO L93 Difference]: Finished difference Result 5404 states and 6512 transitions. [2024-10-23 20:19:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:14,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 146 [2024-10-23 20:19:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:14,524 INFO L225 Difference]: With dead ends: 5404 [2024-10-23 20:19:14,524 INFO L226 Difference]: Without dead ends: 2703 [2024-10-23 20:19:14,527 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-23 20:19:14,530 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:14,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 49 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:19:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2024-10-23 20:19:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2702. [2024-10-23 20:19:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.1703072935949648) internal successors, (3161), 2701 states have internal predecessors, (3161), 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-23 20:19:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3161 transitions. [2024-10-23 20:19:14,603 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3161 transitions. Word has length 146 [2024-10-23 20:19:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:14,603 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 3161 transitions. [2024-10-23 20:19:14,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-23 20:19:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3161 transitions. [2024-10-23 20:19:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-23 20:19:14,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:14,611 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:14,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:19:14,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:14,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1655324605, now seen corresponding path program 1 times [2024-10-23 20:19:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405745820] [2024-10-23 20:19:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:14,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:19:14,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405745820] [2024-10-23 20:19:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405745820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:19:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24572256] [2024-10-23 20:19:14,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:19:14,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:19:14,959 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:19:14,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:19:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:15,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:19:15,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:19:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-23 20:19:15,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:19:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24572256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:15,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:19:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:19:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314761457] [2024-10-23 20:19:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:15,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:19:15,204 INFO L87 Difference]: Start difference. First operand 2702 states and 3161 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-23 20:19:15,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:15,575 INFO L93 Difference]: Finished difference Result 5403 states and 6321 transitions. [2024-10-23 20:19:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:15,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 150 [2024-10-23 20:19:15,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:15,583 INFO L225 Difference]: With dead ends: 5403 [2024-10-23 20:19:15,583 INFO L226 Difference]: Without dead ends: 2702 [2024-10-23 20:19:15,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:19:15,587 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 71 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:15,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 244 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:15,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-10-23 20:19:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2422. [2024-10-23 20:19:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2421 states have (on average 1.1078066914498141) internal successors, (2682), 2421 states have internal predecessors, (2682), 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-23 20:19:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2682 transitions. [2024-10-23 20:19:15,624 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2682 transitions. Word has length 150 [2024-10-23 20:19:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:15,625 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 2682 transitions. [2024-10-23 20:19:15,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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-23 20:19:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2682 transitions. [2024-10-23 20:19:15,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-23 20:19:15,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:15,629 INFO L215 NwaCegarLoop]: trace histogram [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, 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-23 20:19:15,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 20:19:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:19:15,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -760008822, now seen corresponding path program 1 times [2024-10-23 20:19:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837901474] [2024-10-23 20:19:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 20:19:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837901474] [2024-10-23 20:19:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837901474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:15,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:15,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:19:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450639409] [2024-10-23 20:19:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:15,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:15,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:15,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:15,919 INFO L87 Difference]: Start difference. First operand 2422 states and 2682 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:16,250 INFO L93 Difference]: Finished difference Result 5273 states and 5910 transitions. [2024-10-23 20:19:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-23 20:19:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:16,258 INFO L225 Difference]: With dead ends: 5273 [2024-10-23 20:19:16,259 INFO L226 Difference]: Without dead ends: 2852 [2024-10-23 20:19:16,261 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-23 20:19:16,262 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 129 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:16,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 251 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2024-10-23 20:19:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2844. [2024-10-23 20:19:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2843 states have (on average 1.1129088990502989) internal successors, (3164), 2843 states have internal predecessors, (3164), 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-23 20:19:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 3164 transitions. [2024-10-23 20:19:16,294 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 3164 transitions. Word has length 163 [2024-10-23 20:19:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:16,294 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 3164 transitions. [2024-10-23 20:19:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 3164 transitions. [2024-10-23 20:19:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-23 20:19:16,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:16,298 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 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, 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] [2024-10-23 20:19:16,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 20:19:16,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:16,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 373498064, now seen corresponding path program 1 times [2024-10-23 20:19:16,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:16,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137229939] [2024-10-23 20:19:16,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:16,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-23 20:19:16,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:16,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137229939] [2024-10-23 20:19:16,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137229939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:16,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:19:16,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:19:16,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768906937] [2024-10-23 20:19:16,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:16,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:16,444 INFO L87 Difference]: Start difference. First operand 2844 states and 3164 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-23 20:19:16,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:16,757 INFO L93 Difference]: Finished difference Result 4968 states and 5523 transitions. [2024-10-23 20:19:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:16,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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 188 [2024-10-23 20:19:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:16,758 INFO L225 Difference]: With dead ends: 4968 [2024-10-23 20:19:16,758 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:19:16,766 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-23 20:19:16,766 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:16,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 16 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:19:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:19:16,767 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-23 20:19:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:19:16,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2024-10-23 20:19:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:19:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 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-23 20:19:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:19:16,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:19:16,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:19:16,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-23 20:19:16,780 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:16,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:19:17,031 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:19:17,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:19:17 BoogieIcfgContainer [2024-10-23 20:19:17,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:19:17,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:19:17,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:19:17,063 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:19:17,063 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:19:09" (3/4) ... [2024-10-23 20:19:17,065 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:19:17,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:19:17,092 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:19:17,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:19:17,093 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:19:17,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:19:17,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:19:17,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:19:17,251 INFO L158 Benchmark]: Toolchain (without parser) took 9378.41ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 104.4MB in the beginning and 223.0MB in the end (delta: -118.6MB). Peak memory consumption was 94.8MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,251 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:19:17,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.44ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 75.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.51ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 70.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,252 INFO L158 Benchmark]: Boogie Preprocessor took 215.83ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 70.0MB in the beginning and 190.5MB in the end (delta: -120.5MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,252 INFO L158 Benchmark]: RCFGBuilder took 800.06ms. Allocated memory is still 224.4MB. Free memory was 190.5MB in the beginning and 101.3MB in the end (delta: 89.1MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,252 INFO L158 Benchmark]: TraceAbstraction took 7472.53ms. Allocated memory was 224.4MB in the beginning and 371.2MB in the end (delta: 146.8MB). Free memory was 101.3MB in the beginning and 235.6MB in the end (delta: -134.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,252 INFO L158 Benchmark]: Witness Printer took 187.96ms. Allocated memory is still 371.2MB. Free memory was 235.6MB in the beginning and 223.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:19:17,253 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.11ms. Allocated memory is still 159.4MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.44ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 75.9MB in the end (delta: 28.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 132.51ms. Allocated memory is still 159.4MB. Free memory was 75.9MB in the beginning and 70.0MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 215.83ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 70.0MB in the beginning and 190.5MB in the end (delta: -120.5MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * RCFGBuilder took 800.06ms. Allocated memory is still 224.4MB. Free memory was 190.5MB in the beginning and 101.3MB in the end (delta: 89.1MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7472.53ms. Allocated memory was 224.4MB in the beginning and 371.2MB in the end (delta: 146.8MB). Free memory was 101.3MB in the beginning and 235.6MB in the end (delta: -134.2MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 187.96ms. Allocated memory is still 371.2MB. Free memory was 235.6MB in the beginning and 223.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. 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: 458]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.1s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1472 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1472 mSDsluCounter, 1625 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3508 IncrementalHoareTripleChecker+Invalid, 4123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 1485 mSDtfsCounter, 3508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2844occurred in iteration=10, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 716 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1525 NumberOfCodeBlocks, 1525 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1513 ConstructedInterpolants, 0 QuantifiedInterpolants, 2711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 297 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 690/698 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: 616]: Loop Invariant Derived loop invariant: ((((((((((11 <= a28) && (a25 == 1)) && (a11 == 0)) && (a17 <= 8)) && (a19 == 1)) || (((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7))) || ((((a28 == 10) && (a17 <= 8)) && (a25 != 1)) && (a19 == 1))) || (((a17 == 8) && (a28 <= 10)) && (a19 == 1))) || (((a17 == 8) && (a25 == 1)) && (a19 == 1))) || (((a17 <= 8) && (a28 <= 10)) && (a19 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:19:17,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE