./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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/eca-rers2012/Problem12_label27.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 a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:15:23,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:15:23,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:15:23,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:15:23,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:15:23,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:15:23,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:15:23,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:15:23,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:15:23,760 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:15:23,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:15:23,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:15:23,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:15:23,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:15:23,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:15:23,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:15:23,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:15:23,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:15:23,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:15:23,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:15:23,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:15:23,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:15:23,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:15:23,764 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:15:23,764 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:15:23,764 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:15:23,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:15:23,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:15:23,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:15:23,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:15:23,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:15:23,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:15:23,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:15:23,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:15:23,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:15:23,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:15:23,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:15:23,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:15:23,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:15:23,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:15:23,768 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:15:23,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:15:23,769 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 -> a6bf1264929a0645d918c583a519b6be036274699656a22f3fed375c55deb5c8 [2024-11-08 11:15:23,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:15:23,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:15:23,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:15:23,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:15:23,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:15:23,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label27.c [2024-11-08 11:15:25,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:15:25,576 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:15:25,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label27.c [2024-11-08 11:15:25,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0142c7f7/dd8b232e8c4b4152915daa9ce01f8dba/FLAGf42e2ef60 [2024-11-08 11:15:25,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0142c7f7/dd8b232e8c4b4152915daa9ce01f8dba [2024-11-08 11:15:25,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:15:25,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:15:25,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:15:25,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:15:25,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:15:25,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:25" (1/1) ... [2024-11-08 11:15:25,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43f892f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:25, skipping insertion in model container [2024-11-08 11:15:25,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:15:25" (1/1) ... [2024-11-08 11:15:25,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:15:25,953 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/eca-rers2012/Problem12_label27.c[4120,4133] [2024-11-08 11:15:26,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:15:26,514 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:15:26,532 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/eca-rers2012/Problem12_label27.c[4120,4133] [2024-11-08 11:15:26,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:15:26,847 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:15:26,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26 WrapperNode [2024-11-08 11:15:26,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:15:26,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:15:26,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:15:26,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:15:26,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:26,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,118 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-08 11:15:27,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:15:27,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:15:27,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:15:27,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:15:27,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,358 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-08 11:15:27,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:15:27,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:15:27,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:15:27,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:15:27,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (1/1) ... [2024-11-08 11:15:27,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:15:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:15:27,627 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-08 11:15:27,688 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-08 11:15:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:15:27,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:15:27,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:15:27,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:15:27,789 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:15:27,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:15:30,850 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-08 11:15:30,851 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:15:30,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:15:30,874 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:15:30,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:30 BoogieIcfgContainer [2024-11-08 11:15:30,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:15:30,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:15:30,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:15:30,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:15:30,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:15:25" (1/3) ... [2024-11-08 11:15:30,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe50ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:30, skipping insertion in model container [2024-11-08 11:15:30,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:15:26" (2/3) ... [2024-11-08 11:15:30,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afe50ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:15:30, skipping insertion in model container [2024-11-08 11:15:30,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:15:30" (3/3) ... [2024-11-08 11:15:30,881 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label27.c [2024-11-08 11:15:30,894 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:15:30,894 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:15:30,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:15:30,959 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;@23ecea4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:15:30,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:15:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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-08 11:15:30,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 11:15:30,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:30,972 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:15:30,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:30,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1843609039, now seen corresponding path program 1 times [2024-11-08 11:15:30,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:30,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499934332] [2024-11-08 11:15:30,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:31,249 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-08 11:15:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499934332] [2024-11-08 11:15:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499934332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:31,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:15:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902162916] [2024-11-08 11:15:31,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:31,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:31,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:31,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:31,275 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-08 11:15:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:34,155 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2024-11-08 11:15:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-08 11:15:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:34,182 INFO L225 Difference]: With dead ends: 2388 [2024-11-08 11:15:34,183 INFO L226 Difference]: Without dead ends: 1506 [2024-11-08 11:15:34,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:34,191 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 866 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:34,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 156 Invalid, 3208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 11:15:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-08 11:15:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-08 11:15:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.8458471760797341) internal successors, (2778), 1505 states have internal predecessors, (2778), 0 states have call successors, (0), 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-08 11:15:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2778 transitions. [2024-11-08 11:15:34,273 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2778 transitions. Word has length 31 [2024-11-08 11:15:34,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:34,273 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2778 transitions. [2024-11-08 11:15:34,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-08 11:15:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2778 transitions. [2024-11-08 11:15:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-08 11:15:34,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:34,276 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:15:34,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:15:34,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:34,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:34,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1399644642, now seen corresponding path program 1 times [2024-11-08 11:15:34,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:34,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765802522] [2024-11-08 11:15:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:34,485 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:15:34,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:34,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765802522] [2024-11-08 11:15:34,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765802522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:34,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:34,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:15:34,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337363267] [2024-11-08 11:15:34,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:34,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:34,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:34,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:34,489 INFO L87 Difference]: Start difference. First operand 1506 states and 2778 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-08 11:15:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:37,120 INFO L93 Difference]: Finished difference Result 3761 states and 6893 transitions. [2024-11-08 11:15:37,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-08 11:15:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:37,128 INFO L225 Difference]: With dead ends: 3761 [2024-11-08 11:15:37,128 INFO L226 Difference]: Without dead ends: 2257 [2024-11-08 11:15:37,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:37,132 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:37,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 448 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [864 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:15:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-08 11:15:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-08 11:15:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.4419326241134751) internal successors, (3253), 2256 states have internal predecessors, (3253), 0 states have call successors, (0), 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-08 11:15:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3253 transitions. [2024-11-08 11:15:37,172 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3253 transitions. Word has length 100 [2024-11-08 11:15:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:37,172 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3253 transitions. [2024-11-08 11:15:37,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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-08 11:15:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3253 transitions. [2024-11-08 11:15:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 11:15:37,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:37,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:15:37,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:15:37,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:37,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:37,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1168094211, now seen corresponding path program 1 times [2024-11-08 11:15:37,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990665746] [2024-11-08 11:15:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:37,402 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:15:37,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990665746] [2024-11-08 11:15:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990665746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:15:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098481643] [2024-11-08 11:15:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:15:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:15:37,408 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-08 11:15:37,417 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-08 11:15:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:37,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:15:37,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:15:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:15:37,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:15:37,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098481643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:37,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:15:37,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:15:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70915784] [2024-11-08 11:15:37,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:37,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:37,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:37,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:37,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:15:37,538 INFO L87 Difference]: Start difference. First operand 2257 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:15:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:40,173 INFO L93 Difference]: Finished difference Result 6765 states and 9754 transitions. [2024-11-08 11:15:40,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-08 11:15:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:40,185 INFO L225 Difference]: With dead ends: 6765 [2024-11-08 11:15:40,189 INFO L226 Difference]: Without dead ends: 4510 [2024-11-08 11:15:40,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:15:40,193 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 739 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2273 mSolverCounterSat, 684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 2273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:40,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 618 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:15:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2024-11-08 11:15:40,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2024-11-08 11:15:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.2929696163229096) internal successors, (5830), 4509 states have internal predecessors, (5830), 0 states have call successors, (0), 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-08 11:15:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5830 transitions. [2024-11-08 11:15:40,246 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5830 transitions. Word has length 102 [2024-11-08 11:15:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:40,247 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5830 transitions. [2024-11-08 11:15:40,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:15:40,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5830 transitions. [2024-11-08 11:15:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 11:15:40,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:40,249 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:15:40,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:15:40,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:15:40,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:40,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash -958136910, now seen corresponding path program 1 times [2024-11-08 11:15:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316390922] [2024-11-08 11:15:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:40,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:40,646 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:15:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316390922] [2024-11-08 11:15:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316390922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:40,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:15:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969442402] [2024-11-08 11:15:40,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:40,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:15:40,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:40,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:15:40,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:15:40,650 INFO L87 Difference]: Start difference. First operand 4510 states and 5830 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-08 11:15:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:44,737 INFO L93 Difference]: Finished difference Result 14275 states and 18284 transitions. [2024-11-08 11:15:44,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:15:44,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-08 11:15:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:44,761 INFO L225 Difference]: With dead ends: 14275 [2024-11-08 11:15:44,761 INFO L226 Difference]: Without dead ends: 9767 [2024-11-08 11:15:44,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:15:44,768 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:44,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 11:15:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-08 11:15:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2024-11-08 11:15:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.255785377841491) internal successors, (12264), 9766 states have internal predecessors, (12264), 0 states have call successors, (0), 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-08 11:15:44,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12264 transitions. [2024-11-08 11:15:44,894 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12264 transitions. Word has length 108 [2024-11-08 11:15:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:44,894 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12264 transitions. [2024-11-08 11:15:44,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-08 11:15:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12264 transitions. [2024-11-08 11:15:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 11:15:44,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:44,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:15:44,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:15:44,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:44,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:44,901 INFO L85 PathProgramCache]: Analyzing trace with hash 663593248, now seen corresponding path program 1 times [2024-11-08 11:15:44,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:44,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541078782] [2024-11-08 11:15:44,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:44,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:15:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:45,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541078782] [2024-11-08 11:15:45,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541078782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:45,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:15:45,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135321369] [2024-11-08 11:15:45,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:45,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:15:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:45,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:15:45,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:15:45,153 INFO L87 Difference]: Start difference. First operand 9767 states and 12264 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 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-08 11:15:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:47,601 INFO L93 Difference]: Finished difference Result 21822 states and 27290 transitions. [2024-11-08 11:15:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:15:47,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 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 179 [2024-11-08 11:15:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:47,632 INFO L225 Difference]: With dead ends: 21822 [2024-11-08 11:15:47,633 INFO L226 Difference]: Without dead ends: 12771 [2024-11-08 11:15:47,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:15:47,644 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:47,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 612 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:15:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2024-11-08 11:15:47,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12020. [2024-11-08 11:15:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12020 states, 12019 states have (on average 1.2085032032615026) internal successors, (14525), 12019 states have internal predecessors, (14525), 0 states have call successors, (0), 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-08 11:15:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 14525 transitions. [2024-11-08 11:15:47,792 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 14525 transitions. Word has length 179 [2024-11-08 11:15:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:47,792 INFO L471 AbstractCegarLoop]: Abstraction has 12020 states and 14525 transitions. [2024-11-08 11:15:47,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 3 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-08 11:15:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 14525 transitions. [2024-11-08 11:15:47,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-08 11:15:47,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:47,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:15:47,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:15:47,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:47,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:47,796 INFO L85 PathProgramCache]: Analyzing trace with hash 533142505, now seen corresponding path program 1 times [2024-11-08 11:15:47,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:47,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110162433] [2024-11-08 11:15:47,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:47,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:47,934 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-08 11:15:47,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:47,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110162433] [2024-11-08 11:15:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110162433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:15:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798106308] [2024-11-08 11:15:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:47,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:47,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:47,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:47,937 INFO L87 Difference]: Start difference. First operand 12020 states and 14525 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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-08 11:15:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:50,533 INFO L93 Difference]: Finished difference Result 31550 states and 38845 transitions. [2024-11-08 11:15:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 244 [2024-11-08 11:15:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:50,562 INFO L225 Difference]: With dead ends: 31550 [2024-11-08 11:15:50,562 INFO L226 Difference]: Without dead ends: 20283 [2024-11-08 11:15:50,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:50,573 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:50,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 312 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:15:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20283 states. [2024-11-08 11:15:50,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20283 to 18779. [2024-11-08 11:15:50,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.1888380019171372) internal successors, (22324), 18778 states have internal predecessors, (22324), 0 states have call successors, (0), 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-08 11:15:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22324 transitions. [2024-11-08 11:15:50,766 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22324 transitions. Word has length 244 [2024-11-08 11:15:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:50,767 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22324 transitions. [2024-11-08 11:15:50,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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-08 11:15:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22324 transitions. [2024-11-08 11:15:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-08 11:15:50,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:50,771 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:15:50,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:15:50,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:50,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:50,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1736822700, now seen corresponding path program 1 times [2024-11-08 11:15:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332372110] [2024-11-08 11:15:50,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:15:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:50,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332372110] [2024-11-08 11:15:50,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332372110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:50,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:50,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:15:50,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003480015] [2024-11-08 11:15:50,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:50,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:50,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:50,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:50,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:50,950 INFO L87 Difference]: Start difference. First operand 18779 states and 22324 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:15:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:53,354 INFO L93 Difference]: Finished difference Result 43564 states and 53013 transitions. [2024-11-08 11:15:53,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:53,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2024-11-08 11:15:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:53,416 INFO L225 Difference]: With dead ends: 43564 [2024-11-08 11:15:53,420 INFO L226 Difference]: Without dead ends: 25538 [2024-11-08 11:15:53,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:53,450 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:53,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1216 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:15:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25538 states. [2024-11-08 11:15:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25538 to 24036. [2024-11-08 11:15:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24036 states, 24035 states have (on average 1.1785313085084252) internal successors, (28326), 24035 states have internal predecessors, (28326), 0 states have call successors, (0), 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-08 11:15:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24036 states to 24036 states and 28326 transitions. [2024-11-08 11:15:53,892 INFO L78 Accepts]: Start accepts. Automaton has 24036 states and 28326 transitions. Word has length 330 [2024-11-08 11:15:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:53,893 INFO L471 AbstractCegarLoop]: Abstraction has 24036 states and 28326 transitions. [2024-11-08 11:15:53,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:15:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 24036 states and 28326 transitions. [2024-11-08 11:15:53,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2024-11-08 11:15:53,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:53,898 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-08 11:15:53,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:15:53,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:53,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:53,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1107005626, now seen corresponding path program 1 times [2024-11-08 11:15:53,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:53,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988327961] [2024-11-08 11:15:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:53,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:54,084 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-08 11:15:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988327961] [2024-11-08 11:15:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988327961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:54,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:54,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:15:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187847673] [2024-11-08 11:15:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:54,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:54,086 INFO L87 Difference]: Start difference. First operand 24036 states and 28326 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-08 11:15:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:15:56,937 INFO L93 Difference]: Finished difference Result 60837 states and 71503 transitions. [2024-11-08 11:15:56,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:15:56,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 358 [2024-11-08 11:15:56,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:15:57,039 INFO L225 Difference]: With dead ends: 60837 [2024-11-08 11:15:57,040 INFO L226 Difference]: Without dead ends: 37554 [2024-11-08 11:15:57,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:57,086 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 635 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:15:57,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1247 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:15:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37554 states. [2024-11-08 11:15:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37554 to 35301. [2024-11-08 11:15:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35301 states, 35300 states have (on average 1.1668555240793201) internal successors, (41190), 35300 states have internal predecessors, (41190), 0 states have call successors, (0), 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-08 11:15:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 41190 transitions. [2024-11-08 11:15:57,672 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 41190 transitions. Word has length 358 [2024-11-08 11:15:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:15:57,672 INFO L471 AbstractCegarLoop]: Abstraction has 35301 states and 41190 transitions. [2024-11-08 11:15:57,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-08 11:15:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 41190 transitions. [2024-11-08 11:15:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-11-08 11:15:57,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:15:57,681 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:15:57,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:15:57,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:15:57,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:15:57,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1819166716, now seen corresponding path program 1 times [2024-11-08 11:15:57,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:15:57,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087819647] [2024-11-08 11:15:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:15:57,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:15:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:15:57,890 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-08 11:15:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:15:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087819647] [2024-11-08 11:15:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087819647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:15:57,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:15:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:15:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464644730] [2024-11-08 11:15:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:15:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:15:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:15:57,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:15:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:15:57,894 INFO L87 Difference]: Start difference. First operand 35301 states and 41190 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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-08 11:16:00,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:00,383 INFO L93 Difference]: Finished difference Result 102893 states and 120518 transitions. [2024-11-08 11:16:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:00,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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 362 [2024-11-08 11:16:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:00,493 INFO L225 Difference]: With dead ends: 102893 [2024-11-08 11:16:00,493 INFO L226 Difference]: Without dead ends: 63839 [2024-11-08 11:16:00,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:00,561 INFO L432 NwaCegarLoop]: 1307 mSDtfsCounter, 762 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:00,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1315 Invalid, 2854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:16:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63839 states. [2024-11-08 11:16:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63839 to 53325. [2024-11-08 11:16:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53325 states, 53324 states have (on average 1.1311416997974646) internal successors, (60317), 53324 states have internal predecessors, (60317), 0 states have call successors, (0), 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-08 11:16:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53325 states to 53325 states and 60317 transitions. [2024-11-08 11:16:02,053 INFO L78 Accepts]: Start accepts. Automaton has 53325 states and 60317 transitions. Word has length 362 [2024-11-08 11:16:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:02,057 INFO L471 AbstractCegarLoop]: Abstraction has 53325 states and 60317 transitions. [2024-11-08 11:16:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 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-08 11:16:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 53325 states and 60317 transitions. [2024-11-08 11:16:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-08 11:16:02,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:02,066 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 11:16:02,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:16:02,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:02,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash 583367852, now seen corresponding path program 1 times [2024-11-08 11:16:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411621862] [2024-11-08 11:16:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:02,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 11:16:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411621862] [2024-11-08 11:16:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411621862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985408968] [2024-11-08 11:16:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:02,719 INFO L87 Difference]: Start difference. First operand 53325 states and 60317 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:05,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:05,502 INFO L93 Difference]: Finished difference Result 135186 states and 154639 transitions. [2024-11-08 11:16:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:05,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 369 [2024-11-08 11:16:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:05,613 INFO L225 Difference]: With dead ends: 135186 [2024-11-08 11:16:05,613 INFO L226 Difference]: Without dead ends: 82614 [2024-11-08 11:16:05,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:05,645 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 720 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:05,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1236 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:16:05,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82614 states. [2024-11-08 11:16:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82614 to 76606. [2024-11-08 11:16:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76606 states, 76605 states have (on average 1.1163762156517198) internal successors, (85520), 76605 states have internal predecessors, (85520), 0 states have call successors, (0), 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-08 11:16:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76606 states to 76606 states and 85520 transitions. [2024-11-08 11:16:07,037 INFO L78 Accepts]: Start accepts. Automaton has 76606 states and 85520 transitions. Word has length 369 [2024-11-08 11:16:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:07,037 INFO L471 AbstractCegarLoop]: Abstraction has 76606 states and 85520 transitions. [2024-11-08 11:16:07,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:16:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 76606 states and 85520 transitions. [2024-11-08 11:16:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-11-08 11:16:07,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:07,060 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:16:07,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:07,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash 52626568, now seen corresponding path program 1 times [2024-11-08 11:16:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317122015] [2024-11-08 11:16:07,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:07,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 405 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:16:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317122015] [2024-11-08 11:16:09,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317122015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:16:09,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238027350] [2024-11-08 11:16:09,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:09,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:09,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:16:09,361 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-08 11:16:09,362 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-08 11:16:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:09,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:16:09,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:16:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2024-11-08 11:16:10,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:16:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238027350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:10,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:16:10,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-08 11:16:10,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62181249] [2024-11-08 11:16:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:16:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:10,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:16:10,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:16:10,028 INFO L87 Difference]: Start difference. First operand 76606 states and 85520 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 11:16:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:14,796 INFO L93 Difference]: Finished difference Result 236573 states and 265027 transitions. [2024-11-08 11:16:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:16:14,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 466 [2024-11-08 11:16:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:15,018 INFO L225 Difference]: With dead ends: 236573 [2024-11-08 11:16:15,018 INFO L226 Difference]: Without dead ends: 160720 [2024-11-08 11:16:15,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:16:15,091 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1889 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4549 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 4549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:15,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 30 Invalid, 5203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 4549 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 11:16:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160720 states. [2024-11-08 11:16:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160720 to 159216. [2024-11-08 11:16:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159216 states, 159215 states have (on average 1.1147442137989512) internal successors, (177484), 159215 states have internal predecessors, (177484), 0 states have call successors, (0), 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-08 11:16:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159216 states to 159216 states and 177484 transitions. [2024-11-08 11:16:17,657 INFO L78 Accepts]: Start accepts. Automaton has 159216 states and 177484 transitions. Word has length 466 [2024-11-08 11:16:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 159216 states and 177484 transitions. [2024-11-08 11:16:17,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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-08 11:16:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 159216 states and 177484 transitions. [2024-11-08 11:16:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-11-08 11:16:17,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:17,683 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:17,704 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-08 11:16:17,887 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,SelfDestructingSolverStorable10 [2024-11-08 11:16:17,889 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:17,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash 918118859, now seen corresponding path program 1 times [2024-11-08 11:16:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809961504] [2024-11-08 11:16:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 372 proven. 108 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-08 11:16:18,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809961504] [2024-11-08 11:16:18,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809961504] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:16:18,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260142969] [2024-11-08 11:16:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:18,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:18,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:16:18,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:16:18,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:16:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:19,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:16:19,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:16:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-08 11:16:19,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:16:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260142969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:16:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-08 11:16:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154762322] [2024-11-08 11:16:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:19,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:16:19,139 INFO L87 Difference]: Start difference. First operand 159216 states and 177484 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-08 11:16:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:22,739 INFO L93 Difference]: Finished difference Result 353727 states and 399084 transitions. [2024-11-08 11:16:22,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:22,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 518 [2024-11-08 11:16:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:23,143 INFO L225 Difference]: With dead ends: 353727 [2024-11-08 11:16:23,144 INFO L226 Difference]: Without dead ends: 195264 [2024-11-08 11:16:23,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:16:23,217 INFO L432 NwaCegarLoop]: 1389 mSDtfsCounter, 650 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:23,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1397 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:16:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195264 states. [2024-11-08 11:16:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195264 to 183999. [2024-11-08 11:16:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183999 states, 183998 states have (on average 1.1064902879379124) internal successors, (203592), 183998 states have internal predecessors, (203592), 0 states have call successors, (0), 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-08 11:16:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183999 states to 183999 states and 203592 transitions. [2024-11-08 11:16:25,743 INFO L78 Accepts]: Start accepts. Automaton has 183999 states and 203592 transitions. Word has length 518 [2024-11-08 11:16:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 183999 states and 203592 transitions. [2024-11-08 11:16:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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-08 11:16:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 183999 states and 203592 transitions. [2024-11-08 11:16:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2024-11-08 11:16:25,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:25,816 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:25,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 11:16:26,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:16:26,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:26,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:26,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1157473097, now seen corresponding path program 1 times [2024-11-08 11:16:26,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:26,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785642037] [2024-11-08 11:16:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-08 11:16:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:26,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785642037] [2024-11-08 11:16:26,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785642037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:26,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:26,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876833134] [2024-11-08 11:16:26,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:26,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:26,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:26,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:26,894 INFO L87 Difference]: Start difference. First operand 183999 states and 203592 transitions. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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-08 11:16:30,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:30,666 INFO L93 Difference]: Finished difference Result 400289 states and 441188 transitions. [2024-11-08 11:16:30,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:30,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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 728 [2024-11-08 11:16:30,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:30,948 INFO L225 Difference]: With dead ends: 400289 [2024-11-08 11:16:30,948 INFO L226 Difference]: Without dead ends: 217043 [2024-11-08 11:16:31,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:31,027 INFO L432 NwaCegarLoop]: 1241 mSDtfsCounter, 421 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:31,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1249 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:16:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217043 states. [2024-11-08 11:16:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217043 to 196015. [2024-11-08 11:16:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196015 states, 196014 states have (on average 1.0948860795657454) internal successors, (214613), 196014 states have internal predecessors, (214613), 0 states have call successors, (0), 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-08 11:16:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196015 states to 196015 states and 214613 transitions. [2024-11-08 11:16:34,260 INFO L78 Accepts]: Start accepts. Automaton has 196015 states and 214613 transitions. Word has length 728 [2024-11-08 11:16:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:34,260 INFO L471 AbstractCegarLoop]: Abstraction has 196015 states and 214613 transitions. [2024-11-08 11:16:34,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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-08 11:16:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 196015 states and 214613 transitions. [2024-11-08 11:16:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2024-11-08 11:16:34,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:34,293 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:34,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:16:34,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:34,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -772426961, now seen corresponding path program 1 times [2024-11-08 11:16:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415902649] [2024-11-08 11:16:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1541 backedges. 1110 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2024-11-08 11:16:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415902649] [2024-11-08 11:16:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415902649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:35,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 11:16:35,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530116398] [2024-11-08 11:16:35,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:35,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 11:16:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 11:16:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:16:35,264 INFO L87 Difference]: Start difference. First operand 196015 states and 214613 transitions. Second operand has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 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-08 11:16:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:38,712 INFO L93 Difference]: Finished difference Result 394763 states and 432014 transitions. [2024-11-08 11:16:38,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:16:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 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 728 [2024-11-08 11:16:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:38,928 INFO L225 Difference]: With dead ends: 394763 [2024-11-08 11:16:38,928 INFO L226 Difference]: Without dead ends: 194244 [2024-11-08 11:16:39,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:16:39,022 INFO L432 NwaCegarLoop]: 1315 mSDtfsCounter, 1588 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2839 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 3652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:39,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 1326 Invalid, 3652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2839 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-08 11:16:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194244 states. [2024-11-08 11:16:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194244 to 166726. [2024-11-08 11:16:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166726 states, 166725 states have (on average 1.0833948118158645) internal successors, (180629), 166725 states have internal predecessors, (180629), 0 states have call successors, (0), 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-08 11:16:41,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166726 states to 166726 states and 180629 transitions. [2024-11-08 11:16:41,530 INFO L78 Accepts]: Start accepts. Automaton has 166726 states and 180629 transitions. Word has length 728 [2024-11-08 11:16:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:41,530 INFO L471 AbstractCegarLoop]: Abstraction has 166726 states and 180629 transitions. [2024-11-08 11:16:41,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.6) internal successors, (398), 5 states have internal predecessors, (398), 0 states have call successors, (0), 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-08 11:16:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 166726 states and 180629 transitions. [2024-11-08 11:16:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2024-11-08 11:16:41,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:41,557 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:41,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:16:41,557 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:41,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 752966117, now seen corresponding path program 1 times [2024-11-08 11:16:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151186215] [2024-11-08 11:16:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1579 backedges. 1061 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2024-11-08 11:16:42,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:42,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151186215] [2024-11-08 11:16:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151186215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479532801] [2024-11-08 11:16:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:42,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:42,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:42,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:42,512 INFO L87 Difference]: Start difference. First operand 166726 states and 180629 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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-08 11:16:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:16:45,949 INFO L93 Difference]: Finished difference Result 415309 states and 450133 transitions. [2024-11-08 11:16:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:16:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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 736 [2024-11-08 11:16:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:16:46,238 INFO L225 Difference]: With dead ends: 415309 [2024-11-08 11:16:46,238 INFO L226 Difference]: Without dead ends: 249336 [2024-11-08 11:16:46,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:46,323 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:16:46,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 354 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:16:46,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249336 states. [2024-11-08 11:16:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249336 to 229059. [2024-11-08 11:16:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229059 states, 229058 states have (on average 1.08248565865414) internal successors, (247952), 229058 states have internal predecessors, (247952), 0 states have call successors, (0), 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-08 11:16:50,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229059 states to 229059 states and 247952 transitions. [2024-11-08 11:16:50,199 INFO L78 Accepts]: Start accepts. Automaton has 229059 states and 247952 transitions. Word has length 736 [2024-11-08 11:16:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:16:50,199 INFO L471 AbstractCegarLoop]: Abstraction has 229059 states and 247952 transitions. [2024-11-08 11:16:50,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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-08 11:16:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 229059 states and 247952 transitions. [2024-11-08 11:16:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2024-11-08 11:16:50,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:16:50,224 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:16:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:16:50,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:16:50,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:16:50,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2146268274, now seen corresponding path program 1 times [2024-11-08 11:16:50,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:16:50,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191466918] [2024-11-08 11:16:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:16:50,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:16:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:16:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 672 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-11-08 11:16:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:16:51,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191466918] [2024-11-08 11:16:51,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191466918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:16:51,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:16:51,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:16:51,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647321243] [2024-11-08 11:16:51,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:16:51,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:16:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:16:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:16:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:16:51,223 INFO L87 Difference]: Start difference. First operand 229059 states and 247952 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)