./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.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 a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:14:52,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:14:52,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:14:52,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:14:52,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:14:52,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:14:52,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:14:52,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:14:52,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:14:52,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:14:52,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:14:52,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:14:52,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:14:52,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:14:52,745 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:14:52,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:14:52,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:14:52,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:14:52,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:14:52,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:14:52,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:14:52,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:14:52,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:14:52,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:14:52,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:14:52,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:14:52,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:14:52,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:14:52,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:14:52,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:14:52,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:14:52,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:14:52,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:14:52,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:14:52,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:14:52,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:14:52,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:14:52,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:14:52,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:14:52,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:14:52,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:14:52,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:14:52,763 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 -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-11-11 21:14:53,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:14:53,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:14:53,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:14:53,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:14:53,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:14:53,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:54,688 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:14:54,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:14:54,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:54,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d2b899b/8646c5c0532d403180a5e56e42ff2fd5/FLAGc6bceab3a [2024-11-11 21:14:55,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d2b899b/8646c5c0532d403180a5e56e42ff2fd5 [2024-11-11 21:14:55,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:14:55,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:14:55,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:14:55,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:14:55,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:14:55,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2161415c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55, skipping insertion in model container [2024-11-11 21:14:55,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:14:55,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-11 21:14:55,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:14:55,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:14:55,640 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-11 21:14:55,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:14:55,665 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:14:55,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55 WrapperNode [2024-11-11 21:14:55,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:14:55,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:14:55,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:14:55,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:14:55,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,727 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-11 21:14:55,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:14:55,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:14:55,733 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:14:55,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:14:55,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,791 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-11-11 21:14:55,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:14:55,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:14:55,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:14:55,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:14:55,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (1/1) ... [2024-11-11 21:14:55,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:14:55,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:14:55,866 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-11-11 21:14:55,873 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-11-11 21:14:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:14:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:14:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:14:55,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:14:56,014 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:14:56,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:14:56,454 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-11 21:14:56,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:14:56,468 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:14:56,469 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:14:56,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:14:56 BoogieIcfgContainer [2024-11-11 21:14:56,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:14:56,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:14:56,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:14:56,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:14:56,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:14:55" (1/3) ... [2024-11-11 21:14:56,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195a83a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:14:56, skipping insertion in model container [2024-11-11 21:14:56,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:14:55" (2/3) ... [2024-11-11 21:14:56,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195a83a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:14:56, skipping insertion in model container [2024-11-11 21:14:56,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:14:56" (3/3) ... [2024-11-11 21:14:56,479 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-11 21:14:56,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:14:56,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:14:56,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:14:56,554 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;@12d2f5d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:14:56,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:14:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 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-11-11 21:14:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 21:14:56,568 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:56,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:56,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1504435911, now seen corresponding path program 1 times [2024-11-11 21:14:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:56,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615839578] [2024-11-11 21:14:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615839578] [2024-11-11 21:14:57,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615839578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:57,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:57,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482555998] [2024-11-11 21:14:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:57,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:57,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:57,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:57,066 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 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 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-11 21:14:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:57,151 INFO L93 Difference]: Finished difference Result 152 states and 247 transitions. [2024-11-11 21:14:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:57,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2024-11-11 21:14:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:57,164 INFO L225 Difference]: With dead ends: 152 [2024-11-11 21:14:57,165 INFO L226 Difference]: Without dead ends: 101 [2024-11-11 21:14:57,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:57,171 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 61 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:57,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 383 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:57,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-11 21:14:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2024-11-11 21:14:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 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-11-11 21:14:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-11-11 21:14:57,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 25 [2024-11-11 21:14:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:57,211 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-11-11 21:14:57,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-11-11 21:14:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-11-11 21:14:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 21:14:57,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:57,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:14:57,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1452762621, now seen corresponding path program 1 times [2024-11-11 21:14:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:57,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855228941] [2024-11-11 21:14:57,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:57,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:57,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855228941] [2024-11-11 21:14:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855228941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503308523] [2024-11-11 21:14:57,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:57,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:57,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:57,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:57,361 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-11 21:14:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:57,396 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2024-11-11 21:14:57,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:57,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-11 21:14:57,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:57,398 INFO L225 Difference]: With dead ends: 132 [2024-11-11 21:14:57,398 INFO L226 Difference]: Without dead ends: 93 [2024-11-11 21:14:57,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:57,400 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:57,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-11 21:14:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-11 21:14:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 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-11-11 21:14:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-11 21:14:57,413 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 41 [2024-11-11 21:14:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:57,414 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-11 21:14:57,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-11 21:14:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-11 21:14:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 21:14:57,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:57,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:57,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:14:57,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:57,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:57,417 INFO L85 PathProgramCache]: Analyzing trace with hash -364684482, now seen corresponding path program 1 times [2024-11-11 21:14:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240590619] [2024-11-11 21:14:57,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240590619] [2024-11-11 21:14:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240590619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:57,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:57,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:57,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852596039] [2024-11-11 21:14:57,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:57,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:57,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:57,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:57,573 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-11 21:14:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:57,613 INFO L93 Difference]: Finished difference Result 211 states and 319 transitions. [2024-11-11 21:14:57,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:57,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2024-11-11 21:14:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:57,617 INFO L225 Difference]: With dead ends: 211 [2024-11-11 21:14:57,617 INFO L226 Difference]: Without dead ends: 143 [2024-11-11 21:14:57,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:57,623 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:57,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-11 21:14:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-11 21:14:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 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-11-11 21:14:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-11 21:14:57,652 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 41 [2024-11-11 21:14:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:57,652 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-11 21:14:57,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-11-11 21:14:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-11 21:14:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 21:14:57,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:57,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:57,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:14:57,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1258940161, now seen corresponding path program 1 times [2024-11-11 21:14:57,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:57,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428154368] [2024-11-11 21:14:57,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:57,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:57,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428154368] [2024-11-11 21:14:57,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428154368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:57,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:57,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:57,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429142636] [2024-11-11 21:14:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:57,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:57,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:57,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:57,843 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-11-11 21:14:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:57,961 INFO L93 Difference]: Finished difference Result 613 states and 948 transitions. [2024-11-11 21:14:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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 41 [2024-11-11 21:14:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:57,969 INFO L225 Difference]: With dead ends: 613 [2024-11-11 21:14:57,970 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 21:14:57,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:14:57,975 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 315 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:57,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 427 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:14:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 21:14:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 257. [2024-11-11 21:14:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.5) internal successors, (384), 256 states have internal predecessors, (384), 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-11-11 21:14:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2024-11-11 21:14:58,008 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 41 [2024-11-11 21:14:58,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:58,008 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2024-11-11 21:14:58,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-11-11 21:14:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2024-11-11 21:14:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 21:14:58,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:58,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:58,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:14:58,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -755762794, now seen corresponding path program 1 times [2024-11-11 21:14:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999828505] [2024-11-11 21:14:58,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999828505] [2024-11-11 21:14:58,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999828505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:58,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:58,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:14:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701526012] [2024-11-11 21:14:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:58,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:14:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:14:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:58,277 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-11 21:14:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:58,308 INFO L93 Difference]: Finished difference Result 283 states and 417 transitions. [2024-11-11 21:14:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:14:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 42 [2024-11-11 21:14:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:58,311 INFO L225 Difference]: With dead ends: 283 [2024-11-11 21:14:58,311 INFO L226 Difference]: Without dead ends: 281 [2024-11-11 21:14:58,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:14:58,312 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:58,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-11 21:14:58,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-11 21:14:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.457142857142857) internal successors, (408), 280 states have internal predecessors, (408), 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-11-11 21:14:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 408 transitions. [2024-11-11 21:14:58,333 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 408 transitions. Word has length 42 [2024-11-11 21:14:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:58,334 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 408 transitions. [2024-11-11 21:14:58,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-11 21:14:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 408 transitions. [2024-11-11 21:14:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 21:14:58,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:58,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:58,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:14:58,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:58,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1901231689, now seen corresponding path program 1 times [2024-11-11 21:14:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:58,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079570170] [2024-11-11 21:14:58,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079570170] [2024-11-11 21:14:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079570170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:58,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076089710] [2024-11-11 21:14:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:58,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:58,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:58,394 INFO L87 Difference]: Start difference. First operand 281 states and 408 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-11 21:14:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:58,416 INFO L93 Difference]: Finished difference Result 737 states and 1078 transitions. [2024-11-11 21:14:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2024-11-11 21:14:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:58,419 INFO L225 Difference]: With dead ends: 737 [2024-11-11 21:14:58,420 INFO L226 Difference]: Without dead ends: 479 [2024-11-11 21:14:58,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:58,422 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:58,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:58,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-11 21:14:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2024-11-11 21:14:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4369747899159664) internal successors, (684), 476 states have internal predecessors, (684), 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-11-11 21:14:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 684 transitions. [2024-11-11 21:14:58,444 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 684 transitions. Word has length 43 [2024-11-11 21:14:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:58,447 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 684 transitions. [2024-11-11 21:14:58,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-11 21:14:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 684 transitions. [2024-11-11 21:14:58,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-11 21:14:58,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:58,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:14:58,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:14:58,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:58,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:58,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1969854267, now seen corresponding path program 1 times [2024-11-11 21:14:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482185736] [2024-11-11 21:14:58,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482185736] [2024-11-11 21:14:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482185736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:14:58,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:14:58,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:14:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969119243] [2024-11-11 21:14:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:14:58,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:14:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:14:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:14:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:58,538 INFO L87 Difference]: Start difference. First operand 477 states and 684 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-11 21:14:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:14:58,564 INFO L93 Difference]: Finished difference Result 939 states and 1361 transitions. [2024-11-11 21:14:58,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:14:58,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2024-11-11 21:14:58,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:14:58,568 INFO L225 Difference]: With dead ends: 939 [2024-11-11 21:14:58,568 INFO L226 Difference]: Without dead ends: 681 [2024-11-11 21:14:58,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:14:58,569 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:14:58,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:14:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-11 21:14:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2024-11-11 21:14:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.424778761061947) internal successors, (966), 678 states have internal predecessors, (966), 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-11-11 21:14:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 966 transitions. [2024-11-11 21:14:58,591 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 966 transitions. Word has length 43 [2024-11-11 21:14:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:14:58,592 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 966 transitions. [2024-11-11 21:14:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-11 21:14:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 966 transitions. [2024-11-11 21:14:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-11 21:14:58,594 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:14:58,594 INFO L218 NwaCegarLoop]: trace histogram [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] [2024-11-11 21:14:58,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:14:58,595 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:14:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:14:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1387559791, now seen corresponding path program 1 times [2024-11-11 21:14:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:14:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860183738] [2024-11-11 21:14:58,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:14:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:14:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860183738] [2024-11-11 21:14:59,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860183738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:14:59,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396726179] [2024-11-11 21:14:59,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:14:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:14:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:14:59,331 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-11-11 21:14:59,333 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-11-11 21:14:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:14:59,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-11 21:14:59,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:14:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:14:59,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:00,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396726179] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:00,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:00,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2024-11-11 21:15:00,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545509476] [2024-11-11 21:15:00,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:00,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 21:15:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:00,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 21:15:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-11 21:15:00,634 INFO L87 Difference]: Start difference. First operand 679 states and 966 transitions. Second operand has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:05,517 INFO L93 Difference]: Finished difference Result 6681 states and 9503 transitions. [2024-11-11 21:15:05,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-11 21:15:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-11 21:15:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:05,543 INFO L225 Difference]: With dead ends: 6681 [2024-11-11 21:15:05,544 INFO L226 Difference]: Without dead ends: 6027 [2024-11-11 21:15:05,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1609, Invalid=6763, Unknown=0, NotChecked=0, Total=8372 [2024-11-11 21:15:05,552 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 4303 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:05,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4303 Valid, 1154 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:15:05,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2024-11-11 21:15:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3751. [2024-11-11 21:15:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.4136) internal successors, (5301), 3750 states have internal predecessors, (5301), 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-11-11 21:15:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5301 transitions. [2024-11-11 21:15:05,712 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5301 transitions. Word has length 62 [2024-11-11 21:15:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:05,712 INFO L471 AbstractCegarLoop]: Abstraction has 3751 states and 5301 transitions. [2024-11-11 21:15:05,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:05,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5301 transitions. [2024-11-11 21:15:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-11 21:15:05,714 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:05,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:05,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:15:05,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:05,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:05,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:05,916 INFO L85 PathProgramCache]: Analyzing trace with hash 884071765, now seen corresponding path program 1 times [2024-11-11 21:15:05,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:05,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963472603] [2024-11-11 21:15:05,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:05,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 21:15:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963472603] [2024-11-11 21:15:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963472603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263125248] [2024-11-11 21:15:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:06,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:06,042 INFO L87 Difference]: Start difference. First operand 3751 states and 5301 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:06,271 INFO L93 Difference]: Finished difference Result 9311 states and 13286 transitions. [2024-11-11 21:15:06,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:06,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-11 21:15:06,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:06,299 INFO L225 Difference]: With dead ends: 9311 [2024-11-11 21:15:06,299 INFO L226 Difference]: Without dead ends: 7417 [2024-11-11 21:15:06,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:15:06,306 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:06,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 390 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:06,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2024-11-11 21:15:06,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 5542. [2024-11-11 21:15:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 5541 states have (on average 1.4082295614510016) internal successors, (7803), 5541 states have internal predecessors, (7803), 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-11-11 21:15:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7803 transitions. [2024-11-11 21:15:06,520 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7803 transitions. Word has length 63 [2024-11-11 21:15:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 5542 states and 7803 transitions. [2024-11-11 21:15:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7803 transitions. [2024-11-11 21:15:06,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:15:06,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:06,523 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:06,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:15:06,523 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:06,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1986827273, now seen corresponding path program 1 times [2024-11-11 21:15:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456709790] [2024-11-11 21:15:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:15:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:06,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456709790] [2024-11-11 21:15:06,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456709790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:06,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:06,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:06,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20192357] [2024-11-11 21:15:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:06,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:06,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:06,645 INFO L87 Difference]: Start difference. First operand 5542 states and 7803 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:06,858 INFO L93 Difference]: Finished difference Result 11093 states and 15779 transitions. [2024-11-11 21:15:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-11 21:15:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:06,893 INFO L225 Difference]: With dead ends: 11093 [2024-11-11 21:15:06,894 INFO L226 Difference]: Without dead ends: 9217 [2024-11-11 21:15:06,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:15:06,901 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 209 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:06,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2024-11-11 21:15:07,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 7329. [2024-11-11 21:15:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 7328 states have (on average 1.40625) internal successors, (10305), 7328 states have internal predecessors, (10305), 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-11-11 21:15:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 10305 transitions. [2024-11-11 21:15:07,188 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 10305 transitions. Word has length 64 [2024-11-11 21:15:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:07,189 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 10305 transitions. [2024-11-11 21:15:07,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:15:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 10305 transitions. [2024-11-11 21:15:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:15:07,190 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:07,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:07,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:15:07,191 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:07,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:07,192 INFO L85 PathProgramCache]: Analyzing trace with hash 128518073, now seen corresponding path program 1 times [2024-11-11 21:15:07,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:07,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231697690] [2024-11-11 21:15:07,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:07,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:07,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231697690] [2024-11-11 21:15:07,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231697690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:07,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:07,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:07,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130949683] [2024-11-11 21:15:07,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:07,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:07,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:07,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:07,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:07,244 INFO L87 Difference]: Start difference. First operand 7329 states and 10305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-11 21:15:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:07,597 INFO L93 Difference]: Finished difference Result 21004 states and 29365 transitions. [2024-11-11 21:15:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:07,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2024-11-11 21:15:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:07,634 INFO L225 Difference]: With dead ends: 21004 [2024-11-11 21:15:07,634 INFO L226 Difference]: Without dead ends: 13796 [2024-11-11 21:15:07,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:07,648 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:07,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13796 states. [2024-11-11 21:15:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13796 to 13730. [2024-11-11 21:15:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13730 states, 13729 states have (on average 1.3767208099643091) internal successors, (18901), 13729 states have internal predecessors, (18901), 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-11-11 21:15:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13730 states to 13730 states and 18901 transitions. [2024-11-11 21:15:08,121 INFO L78 Accepts]: Start accepts. Automaton has 13730 states and 18901 transitions. Word has length 64 [2024-11-11 21:15:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:08,121 INFO L471 AbstractCegarLoop]: Abstraction has 13730 states and 18901 transitions. [2024-11-11 21:15:08,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-11 21:15:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 13730 states and 18901 transitions. [2024-11-11 21:15:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:15:08,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:08,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:08,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:15:08,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:08,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1614067746, now seen corresponding path program 1 times [2024-11-11 21:15:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559076186] [2024-11-11 21:15:08,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:08,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559076186] [2024-11-11 21:15:08,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559076186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:08,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:08,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:15:08,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796209807] [2024-11-11 21:15:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:08,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:15:08,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:08,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:15:08,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:08,183 INFO L87 Difference]: Start difference. First operand 13730 states and 18901 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-11 21:15:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:08,617 INFO L93 Difference]: Finished difference Result 32557 states and 44891 transitions. [2024-11-11 21:15:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:15:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2024-11-11 21:15:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:08,657 INFO L225 Difference]: With dead ends: 32557 [2024-11-11 21:15:08,657 INFO L226 Difference]: Without dead ends: 19150 [2024-11-11 21:15:08,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:15:08,675 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:08,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2024-11-11 21:15:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 19020. [2024-11-11 21:15:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19020 states, 19019 states have (on average 1.3530154056469845) internal successors, (25733), 19019 states have internal predecessors, (25733), 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-11-11 21:15:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19020 states to 19020 states and 25733 transitions. [2024-11-11 21:15:09,461 INFO L78 Accepts]: Start accepts. Automaton has 19020 states and 25733 transitions. Word has length 64 [2024-11-11 21:15:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:09,461 INFO L471 AbstractCegarLoop]: Abstraction has 19020 states and 25733 transitions. [2024-11-11 21:15:09,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-11-11 21:15:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 19020 states and 25733 transitions. [2024-11-11 21:15:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-11 21:15:09,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:09,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:09,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:15:09,465 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:09,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -231299420, now seen corresponding path program 1 times [2024-11-11 21:15:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:09,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735128294] [2024-11-11 21:15:09,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 21:15:09,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:09,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735128294] [2024-11-11 21:15:09,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735128294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:15:09,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:15:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:15:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305291275] [2024-11-11 21:15:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:15:09,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:15:09,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:09,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:15:09,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:15:09,551 INFO L87 Difference]: Start difference. First operand 19020 states and 25733 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-11-11 21:15:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:15:10,057 INFO L93 Difference]: Finished difference Result 32478 states and 44409 transitions. [2024-11-11 21:15:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:15:10,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 64 [2024-11-11 21:15:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:15:10,116 INFO L225 Difference]: With dead ends: 32478 [2024-11-11 21:15:10,116 INFO L226 Difference]: Without dead ends: 26916 [2024-11-11 21:15:10,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:15:10,129 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 215 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:15:10,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 396 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:15:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26916 states. [2024-11-11 21:15:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26916 to 24229. [2024-11-11 21:15:10,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24229 states, 24228 states have (on average 1.3519894337130594) internal successors, (32756), 24228 states have internal predecessors, (32756), 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-11-11 21:15:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24229 states to 24229 states and 32756 transitions. [2024-11-11 21:15:10,761 INFO L78 Accepts]: Start accepts. Automaton has 24229 states and 32756 transitions. Word has length 64 [2024-11-11 21:15:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:15:10,761 INFO L471 AbstractCegarLoop]: Abstraction has 24229 states and 32756 transitions. [2024-11-11 21:15:10,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-11-11 21:15:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24229 states and 32756 transitions. [2024-11-11 21:15:10,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:15:10,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:15:10,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:15:10,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:15:10,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:15:10,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:15:10,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1027507446, now seen corresponding path program 1 times [2024-11-11 21:15:10,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:15:10,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247095413] [2024-11-11 21:15:10,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:10,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:15:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:11,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:15:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247095413] [2024-11-11 21:15:11,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247095413] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:15:11,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123390412] [2024-11-11 21:15:11,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:15:11,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:15:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:15:11,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:15:11,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 21:15:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:15:11,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-11 21:15:11,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:15:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:14,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:15:18,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:15:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123390412] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:15:18,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:15:18,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 22] total 45 [2024-11-11 21:15:18,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753436567] [2024-11-11 21:15:18,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:15:18,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-11 21:15:18,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:15:18,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-11 21:15:18,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2024-11-11 21:15:18,496 INFO L87 Difference]: Start difference. First operand 24229 states and 32756 transitions. Second operand has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 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-11-11 21:16:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:16:07,844 INFO L93 Difference]: Finished difference Result 255194 states and 344882 transitions. [2024-11-11 21:16:07,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2024-11-11 21:16:07,845 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 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 66 [2024-11-11 21:16:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:16:08,281 INFO L225 Difference]: With dead ends: 255194 [2024-11-11 21:16:08,281 INFO L226 Difference]: Without dead ends: 231001 [2024-11-11 21:16:08,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51499 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=23079, Invalid=86813, Unknown=0, NotChecked=0, Total=109892 [2024-11-11 21:16:08,341 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 5915 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5915 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:16:08,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5915 Valid, 3132 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-11 21:16:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231001 states. [2024-11-11 21:16:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231001 to 92781. [2024-11-11 21:16:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92781 states, 92780 states have (on average 1.3494503125673636) internal successors, (125202), 92780 states have internal predecessors, (125202), 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-11-11 21:16:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92781 states to 92781 states and 125202 transitions. [2024-11-11 21:16:13,489 INFO L78 Accepts]: Start accepts. Automaton has 92781 states and 125202 transitions. Word has length 66 [2024-11-11 21:16:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:16:13,489 INFO L471 AbstractCegarLoop]: Abstraction has 92781 states and 125202 transitions. [2024-11-11 21:16:13,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 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-11-11 21:16:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 92781 states and 125202 transitions. [2024-11-11 21:16:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:16:13,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:16:13,494 INFO L218 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] [2024-11-11 21:16:13,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:16:13,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 21:16:13,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:16:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:16:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash 556898489, now seen corresponding path program 1 times [2024-11-11 21:16:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:16:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478040427] [2024-11-11 21:16:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:16:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:16:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:16:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:16:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:16:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478040427] [2024-11-11 21:16:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478040427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:16:13,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:16:13,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:16:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651070752] [2024-11-11 21:16:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:16:13,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:16:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:16:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:16:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:16:13,754 INFO L87 Difference]: Start difference. First operand 92781 states and 125202 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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)