./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:31:53,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:31:54,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:31:54,085 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:31:54,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:31:54,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:31:54,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:31:54,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:31:54,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:31:54,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:31:54,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:31:54,120 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:31:54,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:31:54,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:31:54,123 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:31:54,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:31:54,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:31:54,124 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:31:54,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:31:54,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:31:54,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:31:54,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:31:54,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:31:54,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:31:54,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:31:54,128 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:31:54,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:31:54,128 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:31:54,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:31:54,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:31:54,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:31:54,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:31:54,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:31:54,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:31:54,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:31:54,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:31:54,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:31:54,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:31:54,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:31:54,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:31:54,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:31:54,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:31:54,134 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 -> 25ff40e1cab2a460fc960bb835e8a5bb98b4f09095caa25e5ce8f52bf887c901 [2024-10-14 03:31:54,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:31:54,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:31:54,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:31:54,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:31:54,400 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:31:54,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:31:55,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:31:55,982 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:31:55,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:31:55,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ca76b46/38fb55228c8e415cb58a8f461876f25f/FLAG8e8b31ee6 [2024-10-14 03:31:56,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ca76b46/38fb55228c8e415cb58a8f461876f25f [2024-10-14 03:31:56,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:31:56,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:31:56,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:31:56,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:31:56,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:31:56,018 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbd272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56, skipping insertion in model container [2024-10-14 03:31:56,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:31:56,264 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960] [2024-10-14 03:31:56,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:31:56,293 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:31:56,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c[5947,5960] [2024-10-14 03:31:56,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:31:56,396 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:31:56,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56 WrapperNode [2024-10-14 03:31:56,397 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:31:56,398 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:31:56,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:31:56,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:31:56,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,442 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-10-14 03:31:56,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:31:56,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:31:56,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:31:56,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:31:56,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:31:56,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:31:56,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:31:56,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:31:56,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:31:56,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (1/1) ... [2024-10-14 03:31:56,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:31:56,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:31:56,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:31:56,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:31:56,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:31:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:31:56,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:31:56,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:31:56,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:31:56,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:31:57,018 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-14 03:31:57,019 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:31:57,068 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:31:57,068 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 03:31:57,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:31:57 BoogieIcfgContainer [2024-10-14 03:31:57,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:31:57,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:31:57,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:31:57,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:31:57,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:31:56" (1/3) ... [2024-10-14 03:31:57,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705141c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:31:57, skipping insertion in model container [2024-10-14 03:31:57,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:31:56" (2/3) ... [2024-10-14 03:31:57,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705141c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:31:57, skipping insertion in model container [2024-10-14 03:31:57,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:31:57" (3/3) ... [2024-10-14 03:31:57,079 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2024-10-14 03:31:57,100 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:31:57,101 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:31:57,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:31:57,181 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;@383f1b08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:31:57,182 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:31:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:31:57,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:57,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:57,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:57,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash -417268953, now seen corresponding path program 1 times [2024-10-14 03:31:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910839309] [2024-10-14 03:31:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:57,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910839309] [2024-10-14 03:31:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910839309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:57,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 03:31:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648437424] [2024-10-14 03:31:57,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:57,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 03:31:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 03:31:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:31:57,451 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 50 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:57,487 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-10-14 03:31:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 03:31:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-14 03:31:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:57,498 INFO L225 Difference]: With dead ends: 83 [2024-10-14 03:31:57,499 INFO L226 Difference]: Without dead ends: 49 [2024-10-14 03:31:57,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 03:31:57,504 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:57,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:57,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-14 03:31:57,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-14 03:31:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2024-10-14 03:31:57,534 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 16 [2024-10-14 03:31:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:57,535 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2024-10-14 03:31:57,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,535 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2024-10-14 03:31:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 03:31:57,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:57,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:57,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:31:57,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:57,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:57,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1004074967, now seen corresponding path program 1 times [2024-10-14 03:31:57,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:57,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527990061] [2024-10-14 03:31:57,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:57,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:57,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527990061] [2024-10-14 03:31:57,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527990061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:57,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:57,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:31:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321680644] [2024-10-14 03:31:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:31:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:31:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:31:57,742 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:57,811 INFO L93 Difference]: Finished difference Result 110 states and 177 transitions. [2024-10-14 03:31:57,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:31:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-14 03:31:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:57,813 INFO L225 Difference]: With dead ends: 110 [2024-10-14 03:31:57,813 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 03:31:57,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:31:57,815 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:57,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 212 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:31:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 03:31:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2024-10-14 03:31:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-10-14 03:31:57,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 16 [2024-10-14 03:31:57,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:57,822 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-10-14 03:31:57,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-10-14 03:31:57,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:31:57,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:57,824 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-10-14 03:31:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:31:57,824 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:57,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash 871528204, now seen corresponding path program 1 times [2024-10-14 03:31:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576474873] [2024-10-14 03:31:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:57,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:58,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:58,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576474873] [2024-10-14 03:31:58,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576474873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:31:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080422334] [2024-10-14 03:31:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:58,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:31:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:58,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:31:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:31:58,008 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10-14 03:31:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:58,178 INFO L93 Difference]: Finished difference Result 223 states and 342 transitions. [2024-10-14 03:31:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:31:58,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10-14 03:31:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:58,181 INFO L225 Difference]: With dead ends: 223 [2024-10-14 03:31:58,182 INFO L226 Difference]: Without dead ends: 194 [2024-10-14 03:31:58,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:31:58,183 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 264 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:58,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 402 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:31:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-14 03:31:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 76. [2024-10-14 03:31:58,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 75 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2024-10-14 03:31:58,198 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 31 [2024-10-14 03:31:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2024-10-14 03:31:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 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-10-14 03:31:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2024-10-14 03:31:58,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 03:31:58,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:58,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:58,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:31:58,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:58,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash -739726020, now seen corresponding path program 1 times [2024-10-14 03:31:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770089978] [2024-10-14 03:31:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:58,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:58,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770089978] [2024-10-14 03:31:58,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770089978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167621937] [2024-10-14 03:31:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:58,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:58,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:58,300 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:58,328 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2024-10-14 03:31:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:58,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-14 03:31:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:58,331 INFO L225 Difference]: With dead ends: 177 [2024-10-14 03:31:58,331 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 03:31:58,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:58,336 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:58,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 101 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 03:31:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-14 03:31:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 118 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 175 transitions. [2024-10-14 03:31:58,349 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 175 transitions. Word has length 33 [2024-10-14 03:31:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:58,349 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 175 transitions. [2024-10-14 03:31:58,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 175 transitions. [2024-10-14 03:31:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 03:31:58,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:58,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:58,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:31:58,351 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:58,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash -737581068, now seen corresponding path program 1 times [2024-10-14 03:31:58,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:58,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784134934] [2024-10-14 03:31:58,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:58,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784134934] [2024-10-14 03:31:58,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784134934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:58,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:58,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:31:58,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223369131] [2024-10-14 03:31:58,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:58,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:31:58,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:58,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:31:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:31:58,610 INFO L87 Difference]: Start difference. First operand 119 states and 175 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:58,693 INFO L93 Difference]: Finished difference Result 220 states and 331 transitions. [2024-10-14 03:31:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:31:58,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-10-14 03:31:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:58,694 INFO L225 Difference]: With dead ends: 220 [2024-10-14 03:31:58,694 INFO L226 Difference]: Without dead ends: 121 [2024-10-14 03:31:58,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:31:58,696 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:58,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 181 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-14 03:31:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-14 03:31:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 173 transitions. [2024-10-14 03:31:58,715 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 173 transitions. Word has length 33 [2024-10-14 03:31:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:58,715 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 173 transitions. [2024-10-14 03:31:58,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 173 transitions. [2024-10-14 03:31:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:31:58,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:58,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:58,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:31:58,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:58,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1404220512, now seen corresponding path program 1 times [2024-10-14 03:31:58,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:58,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571676623] [2024-10-14 03:31:58,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571676623] [2024-10-14 03:31:58,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571676623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:58,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:58,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:31:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111891255] [2024-10-14 03:31:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:58,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:31:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:31:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:31:58,882 INFO L87 Difference]: Start difference. First operand 119 states and 173 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:58,911 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2024-10-14 03:31:58,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:31:58,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 03:31:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:58,913 INFO L225 Difference]: With dead ends: 125 [2024-10-14 03:31:58,914 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 03:31:58,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:31:58,915 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:58,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 03:31:58,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-14 03:31:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.4426229508196722) internal successors, (176), 122 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 176 transitions. [2024-10-14 03:31:58,925 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 176 transitions. Word has length 34 [2024-10-14 03:31:58,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:58,926 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 176 transitions. [2024-10-14 03:31:58,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,926 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 176 transitions. [2024-10-14 03:31:58,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:31:58,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:58,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:58,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:31:58,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:58,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1768252524, now seen corresponding path program 1 times [2024-10-14 03:31:58,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:58,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131789620] [2024-10-14 03:31:58,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:58,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131789620] [2024-10-14 03:31:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131789620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867465542] [2024-10-14 03:31:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:58,979 INFO L87 Difference]: Start difference. First operand 123 states and 176 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:58,999 INFO L93 Difference]: Finished difference Result 237 states and 349 transitions. [2024-10-14 03:31:59,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-14 03:31:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:59,002 INFO L225 Difference]: With dead ends: 237 [2024-10-14 03:31:59,002 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 03:31:59,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:59,004 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:59,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 139 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:59,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 03:31:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-10-14 03:31:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 1.4540229885057472) internal successors, (253), 174 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2024-10-14 03:31:59,028 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 35 [2024-10-14 03:31:59,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:59,028 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2024-10-14 03:31:59,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,028 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2024-10-14 03:31:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:31:59,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:59,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:59,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:31:59,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:59,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1901058708, now seen corresponding path program 1 times [2024-10-14 03:31:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380024512] [2024-10-14 03:31:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:59,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380024512] [2024-10-14 03:31:59,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380024512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:59,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:59,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878541873] [2024-10-14 03:31:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:59,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:59,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:59,099 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:59,125 INFO L93 Difference]: Finished difference Result 457 states and 673 transitions. [2024-10-14 03:31:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-14 03:31:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:59,127 INFO L225 Difference]: With dead ends: 457 [2024-10-14 03:31:59,127 INFO L226 Difference]: Without dead ends: 304 [2024-10-14 03:31:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:59,131 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 34 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:59,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-14 03:31:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-10-14 03:31:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4451827242524917) internal successors, (435), 301 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 435 transitions. [2024-10-14 03:31:59,155 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 435 transitions. Word has length 35 [2024-10-14 03:31:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:59,156 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 435 transitions. [2024-10-14 03:31:59,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 435 transitions. [2024-10-14 03:31:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 03:31:59,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:59,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:31:59,160 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:59,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1505175148, now seen corresponding path program 1 times [2024-10-14 03:31:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529384530] [2024-10-14 03:31:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:31:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:59,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529384530] [2024-10-14 03:31:59,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529384530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:59,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:59,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:31:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508710307] [2024-10-14 03:31:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:31:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:31:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:59,217 INFO L87 Difference]: Start difference. First operand 302 states and 435 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:59,253 INFO L93 Difference]: Finished difference Result 814 states and 1177 transitions. [2024-10-14 03:31:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:31:59,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-14 03:31:59,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:59,258 INFO L225 Difference]: With dead ends: 814 [2024-10-14 03:31:59,258 INFO L226 Difference]: Without dead ends: 534 [2024-10-14 03:31:59,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:31:59,261 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:59,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:59,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-10-14 03:31:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 532. [2024-10-14 03:31:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 531 states have (on average 1.4143126177024483) internal successors, (751), 531 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 751 transitions. [2024-10-14 03:31:59,282 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 751 transitions. Word has length 35 [2024-10-14 03:31:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:59,283 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 751 transitions. [2024-10-14 03:31:59,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 751 transitions. [2024-10-14 03:31:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:31:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:59,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:31:59,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash -217205247, now seen corresponding path program 1 times [2024-10-14 03:31:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:59,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637945758] [2024-10-14 03:31:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:31:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637945758] [2024-10-14 03:31:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637945758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:31:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163572087] [2024-10-14 03:31:59,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:59,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:31:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:59,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:31:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:31:59,422 INFO L87 Difference]: Start difference. First operand 532 states and 751 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:59,550 INFO L93 Difference]: Finished difference Result 2040 states and 2903 transitions. [2024-10-14 03:31:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:31:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 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 49 [2024-10-14 03:31:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:59,557 INFO L225 Difference]: With dead ends: 2040 [2024-10-14 03:31:59,557 INFO L226 Difference]: Without dead ends: 1670 [2024-10-14 03:31:59,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:31:59,560 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 155 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:59,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 276 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:31:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-10-14 03:31:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 972. [2024-10-14 03:31:59,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.411946446961895) internal successors, (1371), 971 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1371 transitions. [2024-10-14 03:31:59,605 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1371 transitions. Word has length 49 [2024-10-14 03:31:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:59,606 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1371 transitions. [2024-10-14 03:31:59,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1371 transitions. [2024-10-14 03:31:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:31:59,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:59,627 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:59,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:31:59,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:59,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -842861311, now seen corresponding path program 1 times [2024-10-14 03:31:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:59,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892504270] [2024-10-14 03:31:59,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:59,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:31:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-14 03:31:59,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:31:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892504270] [2024-10-14 03:31:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892504270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:31:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:31:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:31:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275975282] [2024-10-14 03:31:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:31:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:31:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:31:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:31:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:31:59,764 INFO L87 Difference]: Start difference. First operand 972 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:31:59,881 INFO L93 Difference]: Finished difference Result 2548 states and 3623 transitions. [2024-10-14 03:31:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:31:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 49 [2024-10-14 03:31:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:31:59,889 INFO L225 Difference]: With dead ends: 2548 [2024-10-14 03:31:59,889 INFO L226 Difference]: Without dead ends: 2038 [2024-10-14 03:31:59,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:31:59,891 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 159 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:31:59,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 253 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:31:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2024-10-14 03:31:59,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1664. [2024-10-14 03:31:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1663 states have (on average 1.4088995790739627) internal successors, (2343), 1663 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2343 transitions. [2024-10-14 03:31:59,954 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2343 transitions. Word has length 49 [2024-10-14 03:31:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:31:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2343 transitions. [2024-10-14 03:31:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:31:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2343 transitions. [2024-10-14 03:31:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:31:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:31:59,957 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:31:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:31:59,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:31:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:31:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 45872129, now seen corresponding path program 1 times [2024-10-14 03:31:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:31:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787035418] [2024-10-14 03:31:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:31:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:31:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-14 03:32:00,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:00,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787035418] [2024-10-14 03:32:00,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787035418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:00,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:00,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:32:00,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134014740] [2024-10-14 03:32:00,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:00,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:32:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:00,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:32:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:32:00,090 INFO L87 Difference]: Start difference. First operand 1664 states and 2343 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:00,237 INFO L93 Difference]: Finished difference Result 3056 states and 4339 transitions. [2024-10-14 03:32:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:32:00,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 49 [2024-10-14 03:32:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:00,248 INFO L225 Difference]: With dead ends: 3056 [2024-10-14 03:32:00,249 INFO L226 Difference]: Without dead ends: 2546 [2024-10-14 03:32:00,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:32:00,251 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 163 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 262 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:32:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-10-14 03:32:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2172. [2024-10-14 03:32:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.4090280976508522) internal successors, (3059), 2171 states have internal predecessors, (3059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3059 transitions. [2024-10-14 03:32:00,334 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3059 transitions. Word has length 49 [2024-10-14 03:32:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:00,334 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3059 transitions. [2024-10-14 03:32:00,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3059 transitions. [2024-10-14 03:32:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:32:00,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:00,335 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 03:32:00,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:32:00,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:00,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1885157086, now seen corresponding path program 1 times [2024-10-14 03:32:00,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:00,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643001231] [2024-10-14 03:32:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:00,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:00,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:00,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643001231] [2024-10-14 03:32:00,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643001231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:00,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:00,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:00,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585501312] [2024-10-14 03:32:00,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:00,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:00,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:00,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,418 INFO L87 Difference]: Start difference. First operand 2172 states and 3059 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:00,514 INFO L93 Difference]: Finished difference Result 4324 states and 6097 transitions. [2024-10-14 03:32:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:00,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-14 03:32:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:00,523 INFO L225 Difference]: With dead ends: 4324 [2024-10-14 03:32:00,524 INFO L226 Difference]: Without dead ends: 2174 [2024-10-14 03:32:00,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,528 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:00,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-10-14 03:32:00,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2172. [2024-10-14 03:32:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 2171 states have (on average 1.3859972362966375) internal successors, (3009), 2171 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3009 transitions. [2024-10-14 03:32:00,615 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3009 transitions. Word has length 50 [2024-10-14 03:32:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:00,615 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 3009 transitions. [2024-10-14 03:32:00,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3009 transitions. [2024-10-14 03:32:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:32:00,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:00,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:32:00,617 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1001536681, now seen corresponding path program 1 times [2024-10-14 03:32:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579207200] [2024-10-14 03:32:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:00,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579207200] [2024-10-14 03:32:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579207200] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152247913] [2024-10-14 03:32:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,686 INFO L87 Difference]: Start difference. First operand 2172 states and 3009 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:00,723 INFO L93 Difference]: Finished difference Result 3018 states and 4196 transitions. [2024-10-14 03:32:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:00,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-14 03:32:00,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:00,727 INFO L225 Difference]: With dead ends: 3018 [2024-10-14 03:32:00,728 INFO L226 Difference]: Without dead ends: 868 [2024-10-14 03:32:00,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,731 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:00,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:00,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-14 03:32:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 861. [2024-10-14 03:32:00,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.3767441860465117) internal successors, (1184), 860 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1184 transitions. [2024-10-14 03:32:00,762 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1184 transitions. Word has length 51 [2024-10-14 03:32:00,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:00,763 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1184 transitions. [2024-10-14 03:32:00,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,763 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1184 transitions. [2024-10-14 03:32:00,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:32:00,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:00,764 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:32:00,765 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:00,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1455204816, now seen corresponding path program 1 times [2024-10-14 03:32:00,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:00,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898450320] [2024-10-14 03:32:00,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898450320] [2024-10-14 03:32:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898450320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:32:00,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:32:00,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:32:00,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710589400] [2024-10-14 03:32:00,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:32:00,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:32:00,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:32:00,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,859 INFO L87 Difference]: Start difference. First operand 861 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:00,885 INFO L93 Difference]: Finished difference Result 1279 states and 1762 transitions. [2024-10-14 03:32:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:32:00,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2024-10-14 03:32:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:00,887 INFO L225 Difference]: With dead ends: 1279 [2024-10-14 03:32:00,887 INFO L226 Difference]: Without dead ends: 449 [2024-10-14 03:32:00,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:32:00,889 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:00,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 110 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:32:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-10-14 03:32:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-10-14 03:32:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.34304932735426) internal successors, (599), 446 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 599 transitions. [2024-10-14 03:32:00,906 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 599 transitions. Word has length 52 [2024-10-14 03:32:00,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:00,907 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 599 transitions. [2024-10-14 03:32:00,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 599 transitions. [2024-10-14 03:32:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 03:32:00,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:00,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:00,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:32:00,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:00,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash 923352062, now seen corresponding path program 1 times [2024-10-14 03:32:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:00,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867040] [2024-10-14 03:32:00,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 03:32:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:01,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867040] [2024-10-14 03:32:01,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:01,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834224694] [2024-10-14 03:32:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:01,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:01,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:01,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:32:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:01,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:32:01,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:01,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:02,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834224694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:02,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:02,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2024-10-14 03:32:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119856561] [2024-10-14 03:32:02,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:02,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 03:32:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:02,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 03:32:02,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:32:02,466 INFO L87 Difference]: Start difference. First operand 447 states and 599 transitions. Second operand has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:03,180 INFO L93 Difference]: Finished difference Result 1682 states and 2230 transitions. [2024-10-14 03:32:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 03:32:03,181 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-14 03:32:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:03,186 INFO L225 Difference]: With dead ends: 1682 [2024-10-14 03:32:03,186 INFO L226 Difference]: Without dead ends: 1266 [2024-10-14 03:32:03,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:32:03,188 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 736 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:03,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 332 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:32:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-10-14 03:32:03,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1176. [2024-10-14 03:32:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 1175 states have (on average 1.291063829787234) internal successors, (1517), 1175 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1517 transitions. [2024-10-14 03:32:03,230 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1517 transitions. Word has length 54 [2024-10-14 03:32:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:03,230 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1517 transitions. [2024-10-14 03:32:03,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.722222222222222) internal successors, (139), 18 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1517 transitions. [2024-10-14 03:32:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:32:03,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:03,231 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:03,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:32:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 03:32:03,432 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:03,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:03,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1995107251, now seen corresponding path program 1 times [2024-10-14 03:32:03,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:03,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842578085] [2024-10-14 03:32:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:03,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:03,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:03,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842578085] [2024-10-14 03:32:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842578085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:03,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878506832] [2024-10-14 03:32:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:03,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:03,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:03,812 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-10-14 03:32:03,813 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-10-14 03:32:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:03,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:32:03,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:04,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:04,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878506832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:04,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-14 03:32:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457193794] [2024-10-14 03:32:04,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:32:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:32:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:32:04,938 INFO L87 Difference]: Start difference. First operand 1176 states and 1517 transitions. Second operand has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:06,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:06,714 INFO L93 Difference]: Finished difference Result 5532 states and 7270 transitions. [2024-10-14 03:32:06,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-14 03:32:06,715 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 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 55 [2024-10-14 03:32:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:06,728 INFO L225 Difference]: With dead ends: 5532 [2024-10-14 03:32:06,729 INFO L226 Difference]: Without dead ends: 4485 [2024-10-14 03:32:06,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=527, Invalid=2229, Unknown=0, NotChecked=0, Total=2756 [2024-10-14 03:32:06,733 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 729 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:06,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 803 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:32:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2024-10-14 03:32:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 4401. [2024-10-14 03:32:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4401 states, 4400 states have (on average 1.2722727272727272) internal successors, (5598), 4400 states have internal predecessors, (5598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 5598 transitions. [2024-10-14 03:32:06,925 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 5598 transitions. Word has length 55 [2024-10-14 03:32:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:06,926 INFO L471 AbstractCegarLoop]: Abstraction has 4401 states and 5598 transitions. [2024-10-14 03:32:06,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.478260869565218) internal successors, (149), 22 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 5598 transitions. [2024-10-14 03:32:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:32:06,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:06,927 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:32:06,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:32:07,128 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,SelfDestructingSolverStorable16 [2024-10-14 03:32:07,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:07,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash -769882752, now seen corresponding path program 1 times [2024-10-14 03:32:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:07,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687867545] [2024-10-14 03:32:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687867545] [2024-10-14 03:32:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687867545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826468275] [2024-10-14 03:32:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:08,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:08,532 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-10-14 03:32:08,533 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-10-14 03:32:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:08,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 03:32:08,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:10,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826468275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:13,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 50 [2024-10-14 03:32:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663704640] [2024-10-14 03:32:13,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 03:32:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 03:32:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2194, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 03:32:13,145 INFO L87 Difference]: Start difference. First operand 4401 states and 5598 transitions. Second operand has 50 states, 50 states have (on average 3.1) internal successors, (155), 50 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:36,084 INFO L93 Difference]: Finished difference Result 13521 states and 17551 transitions. [2024-10-14 03:32:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-10-14 03:32:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.1) internal successors, (155), 50 states have internal predecessors, (155), 0 states have call successors, (0), 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 56 [2024-10-14 03:32:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:36,116 INFO L225 Difference]: With dead ends: 13521 [2024-10-14 03:32:36,116 INFO L226 Difference]: Without dead ends: 11214 [2024-10-14 03:32:36,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8809 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=5397, Invalid=22995, Unknown=0, NotChecked=0, Total=28392 [2024-10-14 03:32:36,128 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 3189 mSDsluCounter, 2513 mSDsCounter, 0 mSdLazyCounter, 2805 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3189 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:36,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3189 Valid, 2617 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2805 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 03:32:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11214 states. [2024-10-14 03:32:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11214 to 6286. [2024-10-14 03:32:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6285 states have (on average 1.2991249005568815) internal successors, (8165), 6285 states have internal predecessors, (8165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 8165 transitions. [2024-10-14 03:32:36,473 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 8165 transitions. Word has length 56 [2024-10-14 03:32:36,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:36,473 INFO L471 AbstractCegarLoop]: Abstraction has 6286 states and 8165 transitions. [2024-10-14 03:32:36,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.1) internal successors, (155), 50 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 8165 transitions. [2024-10-14 03:32:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:32:36,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:36,475 INFO L215 NwaCegarLoop]: trace histogram [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-10-14 03:32:36,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 03:32:36,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 03:32:36,677 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:36,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -297652260, now seen corresponding path program 1 times [2024-10-14 03:32:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364582120] [2024-10-14 03:32:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:37,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364582120] [2024-10-14 03:32:37,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364582120] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:37,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509032393] [2024-10-14 03:32:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:37,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:37,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:37,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:37,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:32:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:37,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:32:37,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:38,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:38,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509032393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:38,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:38,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 11] total 34 [2024-10-14 03:32:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709886075] [2024-10-14 03:32:38,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:38,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 03:32:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 03:32:38,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:32:38,979 INFO L87 Difference]: Start difference. First operand 6286 states and 8165 transitions. Second operand has 35 states, 35 states have (on average 4.285714285714286) internal successors, (150), 34 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:41,609 INFO L93 Difference]: Finished difference Result 10054 states and 13099 transitions. [2024-10-14 03:32:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-14 03:32:41,610 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.285714285714286) internal successors, (150), 34 states have internal predecessors, (150), 0 states have call successors, (0), 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 56 [2024-10-14 03:32:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:41,624 INFO L225 Difference]: With dead ends: 10054 [2024-10-14 03:32:41,625 INFO L226 Difference]: Without dead ends: 7287 [2024-10-14 03:32:41,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=831, Invalid=2951, Unknown=0, NotChecked=0, Total=3782 [2024-10-14 03:32:41,631 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 1760 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:41,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 692 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:32:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2024-10-14 03:32:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 4286. [2024-10-14 03:32:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4285 states have (on average 1.292882147024504) internal successors, (5540), 4285 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5540 transitions. [2024-10-14 03:32:41,895 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5540 transitions. Word has length 56 [2024-10-14 03:32:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:41,895 INFO L471 AbstractCegarLoop]: Abstraction has 4286 states and 5540 transitions. [2024-10-14 03:32:41,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.285714285714286) internal successors, (150), 34 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5540 transitions. [2024-10-14 03:32:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 03:32:41,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:41,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:32:41,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 03:32:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:42,097 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:42,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1793421919, now seen corresponding path program 1 times [2024-10-14 03:32:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:42,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527498184] [2024-10-14 03:32:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:43,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:43,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527498184] [2024-10-14 03:32:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527498184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72213753] [2024-10-14 03:32:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:43,235 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:43,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:32:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:43,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:32:43,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:43,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72213753] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:44,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 39 [2024-10-14 03:32:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206504062] [2024-10-14 03:32:44,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 03:32:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 03:32:44,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 03:32:44,438 INFO L87 Difference]: Start difference. First operand 4286 states and 5540 transitions. Second operand has 40 states, 40 states have (on average 3.75) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:50,121 INFO L93 Difference]: Finished difference Result 7552 states and 9820 transitions. [2024-10-14 03:32:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-14 03:32:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.75) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 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 57 [2024-10-14 03:32:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:50,131 INFO L225 Difference]: With dead ends: 7552 [2024-10-14 03:32:50,131 INFO L226 Difference]: Without dead ends: 5234 [2024-10-14 03:32:50,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2382 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1759, Invalid=8341, Unknown=0, NotChecked=0, Total=10100 [2024-10-14 03:32:50,137 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 2071 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2071 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:50,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2071 Valid, 2163 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:32:50,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2024-10-14 03:32:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 3515. [2024-10-14 03:32:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 3514 states have (on average 1.2973819009675582) internal successors, (4559), 3514 states have internal predecessors, (4559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 4559 transitions. [2024-10-14 03:32:50,352 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 4559 transitions. Word has length 57 [2024-10-14 03:32:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:50,352 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 4559 transitions. [2024-10-14 03:32:50,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.75) internal successors, (150), 39 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 4559 transitions. [2024-10-14 03:32:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:32:50,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:50,355 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-10-14 03:32:50,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:32:50,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:50,556 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:50,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:50,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1781051003, now seen corresponding path program 1 times [2024-10-14 03:32:50,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:50,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431135407] [2024-10-14 03:32:50,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:50,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431135407] [2024-10-14 03:32:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431135407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465104520] [2024-10-14 03:32:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:51,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:51,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:51,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:51,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:32:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:51,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:32:51,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-14 03:32:51,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:32:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 16 proven. 60 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 03:32:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465104520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:32:51,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:32:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 8] total 23 [2024-10-14 03:32:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556794964] [2024-10-14 03:32:51,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:32:51,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:32:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:32:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:32:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:32:51,980 INFO L87 Difference]: Start difference. First operand 3515 states and 4559 transitions. Second operand has 23 states, 23 states have (on average 10.217391304347826) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:57,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:32:57,377 INFO L93 Difference]: Finished difference Result 16880 states and 21776 transitions. [2024-10-14 03:32:57,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-14 03:32:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.217391304347826) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 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 93 [2024-10-14 03:32:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:32:57,400 INFO L225 Difference]: With dead ends: 16880 [2024-10-14 03:32:57,400 INFO L226 Difference]: Without dead ends: 13580 [2024-10-14 03:32:57,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5307 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2146, Invalid=12616, Unknown=0, NotChecked=0, Total=14762 [2024-10-14 03:32:57,409 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 1501 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:32:57,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1293 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:32:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13580 states. [2024-10-14 03:32:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13580 to 8518. [2024-10-14 03:32:57,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8518 states, 8517 states have (on average 1.232006575085124) internal successors, (10493), 8517 states have internal predecessors, (10493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 10493 transitions. [2024-10-14 03:32:57,987 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 10493 transitions. Word has length 93 [2024-10-14 03:32:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:32:57,987 INFO L471 AbstractCegarLoop]: Abstraction has 8518 states and 10493 transitions. [2024-10-14 03:32:57,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.217391304347826) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:32:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 10493 transitions. [2024-10-14 03:32:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:32:57,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:32:57,990 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-14 03:32:58,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 03:32:58,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:58,195 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:32:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:32:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash -462747451, now seen corresponding path program 1 times [2024-10-14 03:32:58,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:32:58,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485102038] [2024-10-14 03:32:58,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:58,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:32:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:32:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485102038] [2024-10-14 03:32:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485102038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:32:58,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36095466] [2024-10-14 03:32:58,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:32:58,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:32:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:32:58,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:32:58,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 03:32:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:32:58,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 03:32:58,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:32:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:32:59,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:33:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:00,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36095466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:33:00,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:33:00,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 11] total 35 [2024-10-14 03:33:00,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548674380] [2024-10-14 03:33:00,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:33:00,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-14 03:33:00,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:33:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-14 03:33:00,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:33:00,981 INFO L87 Difference]: Start difference. First operand 8518 states and 10493 transitions. Second operand has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 35 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:33:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:33:04,092 INFO L93 Difference]: Finished difference Result 17125 states and 21126 transitions. [2024-10-14 03:33:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 03:33:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 35 states have internal predecessors, (250), 0 states have call successors, (0), 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 93 [2024-10-14 03:33:04,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:33:04,113 INFO L225 Difference]: With dead ends: 17125 [2024-10-14 03:33:04,113 INFO L226 Difference]: Without dead ends: 12518 [2024-10-14 03:33:04,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=812, Invalid=3220, Unknown=0, NotChecked=0, Total=4032 [2024-10-14 03:33:04,121 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 885 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:33:04,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 912 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:33:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12518 states. [2024-10-14 03:33:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12518 to 9657. [2024-10-14 03:33:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 9656 states have (on average 1.2040182270091135) internal successors, (11626), 9656 states have internal predecessors, (11626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:33:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 11626 transitions. [2024-10-14 03:33:04,799 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 11626 transitions. Word has length 93 [2024-10-14 03:33:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:33:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 11626 transitions. [2024-10-14 03:33:04,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.142857142857143) internal successors, (250), 35 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:33:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 11626 transitions. [2024-10-14 03:33:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:33:04,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:33:04,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-10-14 03:33:04,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 03:33:05,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:33:05,003 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:33:05,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:33:05,003 INFO L85 PathProgramCache]: Analyzing trace with hash 186114746, now seen corresponding path program 1 times [2024-10-14 03:33:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:33:05,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258514595] [2024-10-14 03:33:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:33:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:33:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:33:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 19 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:05,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:33:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258514595] [2024-10-14 03:33:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258514595] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:33:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825105362] [2024-10-14 03:33:05,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:33:05,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:33:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:33:05,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:33:05,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 03:33:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:33:05,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-14 03:33:05,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:33:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:08,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:33:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:33:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825105362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:33:12,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:33:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 27, 25] total 62 [2024-10-14 03:33:12,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776203013] [2024-10-14 03:33:12,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:33:12,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-10-14 03:33:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:33:12,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-10-14 03:33:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=3453, Unknown=0, NotChecked=0, Total=3782 [2024-10-14 03:33:12,961 INFO L87 Difference]: Start difference. First operand 9657 states and 11626 transitions. Second operand has 62 states, 62 states have (on average 4.145161290322581) internal successors, (257), 62 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)