./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:40:20,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:40:21,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:40:21,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:40:21,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:40:21,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:40:21,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:40:21,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:40:21,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:40:21,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:40:21,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:40:21,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:40:21,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:40:21,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:40:21,057 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:40:21,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:40:21,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:40:21,061 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:40:21,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:40:21,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:40:21,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:40:21,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:40:21,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:40:21,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:40:21,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:40:21,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:40:21,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:40:21,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:40:21,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:40:21,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:40:21,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:40:21,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:40:21,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:40:21,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:40:21,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:40:21,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:40:21,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:40:21,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:40:21,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:40:21,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:40:21,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:40:21,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:40:21,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eb970df9460734baa401f9be0d88efb243a90e1dffe6744cd9f9a47afa0217 [2024-11-18 14:40:21,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:40:21,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:40:21,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:40:21,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:40:21,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:40:21,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-18 14:40:22,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:40:23,149 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:40:23,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-18 14:40:23,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60235a9b/f10c650644d54fc9b58f75ccdbd7cb49/FLAG00f257f48 [2024-11-18 14:40:23,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60235a9b/f10c650644d54fc9b58f75ccdbd7cb49 [2024-11-18 14:40:23,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:40:23,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:40:23,179 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:40:23,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:40:23,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:40:23,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10661ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23, skipping insertion in model container [2024-11-18 14:40:23,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:40:23,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-18 14:40:23,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:40:23,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:40:23,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2024-11-18 14:40:23,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:40:23,529 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:40:23,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23 WrapperNode [2024-11-18 14:40:23,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:40:23,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:40:23,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:40:23,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:40:23,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,579 INFO L138 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-18 14:40:23,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:40:23,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:40:23,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:40:23,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:40:23,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,623 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 14:40:23,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:40:23,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:40:23,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:40:23,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:40:23,652 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (1/1) ... [2024-11-18 14:40:23,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:40:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:40:23,691 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 14:40:23,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 14:40:23,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:40:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:40:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:40:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:40:23,850 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:40:23,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:40:24,370 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-18 14:40:24,370 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:40:24,389 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:40:24,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 14:40:24,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:24 BoogieIcfgContainer [2024-11-18 14:40:24,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:40:24,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:40:24,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:40:24,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:40:24,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:40:23" (1/3) ... [2024-11-18 14:40:24,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1618b362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:24, skipping insertion in model container [2024-11-18 14:40:24,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:40:23" (2/3) ... [2024-11-18 14:40:24,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1618b362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:40:24, skipping insertion in model container [2024-11-18 14:40:24,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:40:24" (3/3) ... [2024-11-18 14:40:24,403 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2024-11-18 14:40:24,423 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:40:24,424 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:40:24,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:40:24,504 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;@51a423d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:40:24,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:40:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 14:40:24,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:24,521 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] [2024-11-18 14:40:24,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:24,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1504435911, now seen corresponding path program 1 times [2024-11-18 14:40:24,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506577769] [2024-11-18 14:40:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:24,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:24,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506577769] [2024-11-18 14:40:24,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506577769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:24,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:24,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734312925] [2024-11-18 14:40:24,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:24,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:25,019 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.703125) internal successors, (109), 65 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:25,131 INFO L93 Difference]: Finished difference Result 152 states and 247 transitions. [2024-11-18 14:40:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:25,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-18 14:40:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:25,148 INFO L225 Difference]: With dead ends: 152 [2024-11-18 14:40:25,148 INFO L226 Difference]: Without dead ends: 101 [2024-11-18 14:40:25,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:25,158 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 61 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:25,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 383 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:40:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-18 14:40:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2024-11-18 14:40:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2024-11-18 14:40:25,191 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 25 [2024-11-18 14:40:25,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:25,191 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2024-11-18 14:40:25,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2024-11-18 14:40:25,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 14:40:25,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:25,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:25,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:40:25,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:25,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1452762621, now seen corresponding path program 1 times [2024-11-18 14:40:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:25,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437084218] [2024-11-18 14:40:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:25,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437084218] [2024-11-18 14:40:25,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437084218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:25,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:25,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905994122] [2024-11-18 14:40:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:25,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:25,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:25,339 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:25,379 INFO L93 Difference]: Finished difference Result 132 states and 195 transitions. [2024-11-18 14:40:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:25,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-18 14:40:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:25,382 INFO L225 Difference]: With dead ends: 132 [2024-11-18 14:40:25,382 INFO L226 Difference]: Without dead ends: 93 [2024-11-18 14:40:25,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:25,384 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:25,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:25,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-18 14:40:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2024-11-18 14:40:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4555555555555555) internal successors, (131), 90 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 131 transitions. [2024-11-18 14:40:25,406 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 131 transitions. Word has length 41 [2024-11-18 14:40:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:25,407 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 131 transitions. [2024-11-18 14:40:25,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 131 transitions. [2024-11-18 14:40:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 14:40:25,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:25,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:40:25,408 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:25,413 INFO L85 PathProgramCache]: Analyzing trace with hash -364684482, now seen corresponding path program 1 times [2024-11-18 14:40:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:25,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497096729] [2024-11-18 14:40:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497096729] [2024-11-18 14:40:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497096729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:25,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:25,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:25,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243087080] [2024-11-18 14:40:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:25,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:25,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:25,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:25,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:25,546 INFO L87 Difference]: Start difference. First operand 91 states and 131 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:25,583 INFO L93 Difference]: Finished difference Result 211 states and 319 transitions. [2024-11-18 14:40:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-18 14:40:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:25,588 INFO L225 Difference]: With dead ends: 211 [2024-11-18 14:40:25,590 INFO L226 Difference]: Without dead ends: 143 [2024-11-18 14:40:25,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:25,592 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 42 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:25,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-18 14:40:25,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-11-18 14:40:25,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-11-18 14:40:25,612 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 41 [2024-11-18 14:40:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:25,613 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-11-18 14:40:25,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-11-18 14:40:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-18 14:40:25,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:25,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:25,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:40:25,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:25,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1258940161, now seen corresponding path program 1 times [2024-11-18 14:40:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:25,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992573522] [2024-11-18 14:40:25,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:25,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:25,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992573522] [2024-11-18 14:40:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992573522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:25,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:25,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694078184] [2024-11-18 14:40:25,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:25,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:25,833 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:25,951 INFO L93 Difference]: Finished difference Result 613 states and 948 transitions. [2024-11-18 14:40:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-18 14:40:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:25,955 INFO L225 Difference]: With dead ends: 613 [2024-11-18 14:40:25,956 INFO L226 Difference]: Without dead ends: 495 [2024-11-18 14:40:25,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:40:25,958 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 315 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:25,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 427 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:40:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-18 14:40:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 257. [2024-11-18 14:40:25,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.5) internal successors, (384), 256 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 384 transitions. [2024-11-18 14:40:25,983 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 384 transitions. Word has length 41 [2024-11-18 14:40:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 384 transitions. [2024-11-18 14:40:25,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 384 transitions. [2024-11-18 14:40:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 14:40:25,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:25,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:25,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:40:25,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:25,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -755762794, now seen corresponding path program 1 times [2024-11-18 14:40:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266208347] [2024-11-18 14:40:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:26,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:26,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266208347] [2024-11-18 14:40:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266208347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:26,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:26,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:26,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934033259] [2024-11-18 14:40:26,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:26,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:26,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:26,248 INFO L87 Difference]: Start difference. First operand 257 states and 384 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:26,291 INFO L93 Difference]: Finished difference Result 283 states and 417 transitions. [2024-11-18 14:40:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:26,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-18 14:40:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:26,295 INFO L225 Difference]: With dead ends: 283 [2024-11-18 14:40:26,295 INFO L226 Difference]: Without dead ends: 281 [2024-11-18 14:40:26,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:26,297 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:26,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-18 14:40:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-11-18 14:40:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.457142857142857) internal successors, (408), 280 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 408 transitions. [2024-11-18 14:40:26,327 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 408 transitions. Word has length 42 [2024-11-18 14:40:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:26,327 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 408 transitions. [2024-11-18 14:40:26,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 408 transitions. [2024-11-18 14:40:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 14:40:26,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:26,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:26,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:40:26,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:26,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:26,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1901231689, now seen corresponding path program 1 times [2024-11-18 14:40:26,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:26,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81374304] [2024-11-18 14:40:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81374304] [2024-11-18 14:40:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81374304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65254650] [2024-11-18 14:40:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:26,429 INFO L87 Difference]: Start difference. First operand 281 states and 408 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:26,456 INFO L93 Difference]: Finished difference Result 737 states and 1078 transitions. [2024-11-18 14:40:26,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:26,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-18 14:40:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:26,479 INFO L225 Difference]: With dead ends: 737 [2024-11-18 14:40:26,479 INFO L226 Difference]: Without dead ends: 479 [2024-11-18 14:40:26,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:26,482 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:26,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-18 14:40:26,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 477. [2024-11-18 14:40:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.4369747899159664) internal successors, (684), 476 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 684 transitions. [2024-11-18 14:40:26,519 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 684 transitions. Word has length 43 [2024-11-18 14:40:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 684 transitions. [2024-11-18 14:40:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 684 transitions. [2024-11-18 14:40:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-18 14:40:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:26,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:26,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:40:26,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:26,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:26,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1969854267, now seen corresponding path program 1 times [2024-11-18 14:40:26,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:26,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617281871] [2024-11-18 14:40:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:26,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:26,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617281871] [2024-11-18 14:40:26,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617281871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:26,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:26,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:26,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961671016] [2024-11-18 14:40:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:26,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:26,622 INFO L87 Difference]: Start difference. First operand 477 states and 684 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:26,651 INFO L93 Difference]: Finished difference Result 939 states and 1361 transitions. [2024-11-18 14:40:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-18 14:40:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:26,655 INFO L225 Difference]: With dead ends: 939 [2024-11-18 14:40:26,656 INFO L226 Difference]: Without dead ends: 681 [2024-11-18 14:40:26,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:26,660 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 50 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:26,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-18 14:40:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2024-11-18 14:40:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.424778761061947) internal successors, (966), 678 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 966 transitions. [2024-11-18 14:40:26,691 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 966 transitions. Word has length 43 [2024-11-18 14:40:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 966 transitions. [2024-11-18 14:40:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 966 transitions. [2024-11-18 14:40:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-18 14:40:26,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:26,694 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, 1, 1, 1, 1, 1] [2024-11-18 14:40:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:40:26,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1387559791, now seen corresponding path program 1 times [2024-11-18 14:40:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346447057] [2024-11-18 14:40:26,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346447057] [2024-11-18 14:40:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346447057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:40:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598608831] [2024-11-18 14:40:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:40:27,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:40:27,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:40:27,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:40:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:27,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 14:40:27,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:40:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:28,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:40:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598608831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:40:28,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:40:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2024-11-18 14:40:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014266839] [2024-11-18 14:40:28,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:40:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 14:40:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 14:40:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-18 14:40:28,675 INFO L87 Difference]: Start difference. First operand 679 states and 966 transitions. Second operand has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:33,215 INFO L93 Difference]: Finished difference Result 6681 states and 9503 transitions. [2024-11-18 14:40:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-18 14:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-18 14:40:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:33,238 INFO L225 Difference]: With dead ends: 6681 [2024-11-18 14:40:33,239 INFO L226 Difference]: Without dead ends: 6027 [2024-11-18 14:40:33,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1609, Invalid=6763, Unknown=0, NotChecked=0, Total=8372 [2024-11-18 14:40:33,246 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 4303 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4303 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:33,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4303 Valid, 1154 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 14:40:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6027 states. [2024-11-18 14:40:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6027 to 3751. [2024-11-18 14:40:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3751 states, 3750 states have (on average 1.4136) internal successors, (5301), 3750 states have internal predecessors, (5301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3751 states to 3751 states and 5301 transitions. [2024-11-18 14:40:33,477 INFO L78 Accepts]: Start accepts. Automaton has 3751 states and 5301 transitions. Word has length 62 [2024-11-18 14:40:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:33,478 INFO L471 AbstractCegarLoop]: Abstraction has 3751 states and 5301 transitions. [2024-11-18 14:40:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.333333333333334) internal successors, (175), 21 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3751 states and 5301 transitions. [2024-11-18 14:40:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-18 14:40:33,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:33,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:33,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:40:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:40:33,681 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 884071765, now seen corresponding path program 1 times [2024-11-18 14:40:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140164143] [2024-11-18 14:40:33,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:40:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:33,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140164143] [2024-11-18 14:40:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140164143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486312302] [2024-11-18 14:40:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:33,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:33,806 INFO L87 Difference]: Start difference. First operand 3751 states and 5301 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:33,984 INFO L93 Difference]: Finished difference Result 9311 states and 13286 transitions. [2024-11-18 14:40:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-18 14:40:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:34,012 INFO L225 Difference]: With dead ends: 9311 [2024-11-18 14:40:34,012 INFO L226 Difference]: Without dead ends: 7417 [2024-11-18 14:40:34,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:40:34,023 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 209 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:34,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 390 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:34,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2024-11-18 14:40:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 5542. [2024-11-18 14:40:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5542 states, 5541 states have (on average 1.4082295614510016) internal successors, (7803), 5541 states have internal predecessors, (7803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5542 states to 5542 states and 7803 transitions. [2024-11-18 14:40:34,262 INFO L78 Accepts]: Start accepts. Automaton has 5542 states and 7803 transitions. Word has length 63 [2024-11-18 14:40:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:34,262 INFO L471 AbstractCegarLoop]: Abstraction has 5542 states and 7803 transitions. [2024-11-18 14:40:34,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5542 states and 7803 transitions. [2024-11-18 14:40:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:40:34,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:34,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:34,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:40:34,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:34,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1986827273, now seen corresponding path program 1 times [2024-11-18 14:40:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:34,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241849569] [2024-11-18 14:40:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:34,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:34,370 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-18 14:40:34,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:34,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241849569] [2024-11-18 14:40:34,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241849569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:34,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:34,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:34,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697911982] [2024-11-18 14:40:34,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:34,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:34,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:34,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:34,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:34,373 INFO L87 Difference]: Start difference. First operand 5542 states and 7803 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:34,607 INFO L93 Difference]: Finished difference Result 11093 states and 15779 transitions. [2024-11-18 14:40:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:34,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-18 14:40:34,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:34,641 INFO L225 Difference]: With dead ends: 11093 [2024-11-18 14:40:34,641 INFO L226 Difference]: Without dead ends: 9217 [2024-11-18 14:40:34,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:40:34,648 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 209 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:34,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 368 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2024-11-18 14:40:34,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 7329. [2024-11-18 14:40:34,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7329 states, 7328 states have (on average 1.40625) internal successors, (10305), 7328 states have internal predecessors, (10305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7329 states to 7329 states and 10305 transitions. [2024-11-18 14:40:34,942 INFO L78 Accepts]: Start accepts. Automaton has 7329 states and 10305 transitions. Word has length 64 [2024-11-18 14:40:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:34,942 INFO L471 AbstractCegarLoop]: Abstraction has 7329 states and 10305 transitions. [2024-11-18 14:40:34,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7329 states and 10305 transitions. [2024-11-18 14:40:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:40:34,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:34,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:34,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 14:40:34,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:34,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 128518073, now seen corresponding path program 1 times [2024-11-18 14:40:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058553537] [2024-11-18 14:40:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:34,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:34,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:34,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058553537] [2024-11-18 14:40:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058553537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:34,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408259421] [2024-11-18 14:40:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:34,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:34,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:34,997 INFO L87 Difference]: Start difference. First operand 7329 states and 10305 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:35,340 INFO L93 Difference]: Finished difference Result 21004 states and 29365 transitions. [2024-11-18 14:40:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:35,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-18 14:40:35,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:35,378 INFO L225 Difference]: With dead ends: 21004 [2024-11-18 14:40:35,379 INFO L226 Difference]: Without dead ends: 13796 [2024-11-18 14:40:35,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:35,392 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:35,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 196 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:35,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13796 states. [2024-11-18 14:40:35,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13796 to 13730. [2024-11-18 14:40:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13730 states, 13729 states have (on average 1.3767208099643091) internal successors, (18901), 13729 states have internal predecessors, (18901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13730 states to 13730 states and 18901 transitions. [2024-11-18 14:40:35,900 INFO L78 Accepts]: Start accepts. Automaton has 13730 states and 18901 transitions. Word has length 64 [2024-11-18 14:40:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:35,901 INFO L471 AbstractCegarLoop]: Abstraction has 13730 states and 18901 transitions. [2024-11-18 14:40:35,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 13730 states and 18901 transitions. [2024-11-18 14:40:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:40:35,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:35,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:35,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:40:35,903 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:35,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1614067746, now seen corresponding path program 1 times [2024-11-18 14:40:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013835723] [2024-11-18 14:40:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:35,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:35,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:35,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013835723] [2024-11-18 14:40:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013835723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:35,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:40:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588213901] [2024-11-18 14:40:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:35,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:40:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:40:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:35,969 INFO L87 Difference]: Start difference. First operand 13730 states and 18901 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:36,386 INFO L93 Difference]: Finished difference Result 32557 states and 44891 transitions. [2024-11-18 14:40:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:40:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-18 14:40:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:36,428 INFO L225 Difference]: With dead ends: 32557 [2024-11-18 14:40:36,428 INFO L226 Difference]: Without dead ends: 19150 [2024-11-18 14:40:36,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:40:36,447 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:36,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 171 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19150 states. [2024-11-18 14:40:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19150 to 19020. [2024-11-18 14:40:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19020 states, 19019 states have (on average 1.3530154056469845) internal successors, (25733), 19019 states have internal predecessors, (25733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19020 states to 19020 states and 25733 transitions. [2024-11-18 14:40:37,113 INFO L78 Accepts]: Start accepts. Automaton has 19020 states and 25733 transitions. Word has length 64 [2024-11-18 14:40:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:37,113 INFO L471 AbstractCegarLoop]: Abstraction has 19020 states and 25733 transitions. [2024-11-18 14:40:37,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19020 states and 25733 transitions. [2024-11-18 14:40:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:40:37,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:37,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:40:37,117 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:37,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash -231299420, now seen corresponding path program 1 times [2024-11-18 14:40:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:37,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233283276] [2024-11-18 14:40:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:37,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-18 14:40:37,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:37,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233283276] [2024-11-18 14:40:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233283276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:40:37,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:40:37,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:40:37,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123229738] [2024-11-18 14:40:37,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:40:37,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:40:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:40:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:40:37,224 INFO L87 Difference]: Start difference. First operand 19020 states and 25733 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:40:37,786 INFO L93 Difference]: Finished difference Result 32478 states and 44409 transitions. [2024-11-18 14:40:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:40:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-18 14:40:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:40:37,843 INFO L225 Difference]: With dead ends: 32478 [2024-11-18 14:40:37,843 INFO L226 Difference]: Without dead ends: 26916 [2024-11-18 14:40:37,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:40:37,861 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 215 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:40:37,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 396 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:40:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26916 states. [2024-11-18 14:40:38,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26916 to 24229. [2024-11-18 14:40:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24229 states, 24228 states have (on average 1.3519894337130594) internal successors, (32756), 24228 states have internal predecessors, (32756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24229 states to 24229 states and 32756 transitions. [2024-11-18 14:40:38,702 INFO L78 Accepts]: Start accepts. Automaton has 24229 states and 32756 transitions. Word has length 64 [2024-11-18 14:40:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:40:38,703 INFO L471 AbstractCegarLoop]: Abstraction has 24229 states and 32756 transitions. [2024-11-18 14:40:38,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:40:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 24229 states and 32756 transitions. [2024-11-18 14:40:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 14:40:38,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:40:38,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:40:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 14:40:38,706 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:40:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:40:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1027507446, now seen corresponding path program 1 times [2024-11-18 14:40:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:40:38,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452232018] [2024-11-18 14:40:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:40:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:40:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452232018] [2024-11-18 14:40:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452232018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:40:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413650678] [2024-11-18 14:40:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:40:39,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:40:39,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:40:39,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:40:39,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 14:40:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:40:39,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-18 14:40:39,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:40:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:42,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:40:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:40:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413650678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:40:46,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:40:46,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 22] total 45 [2024-11-18 14:40:46,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492550801] [2024-11-18 14:40:46,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:40:46,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-18 14:40:46,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:40:46,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-18 14:40:46,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2024-11-18 14:40:46,545 INFO L87 Difference]: Start difference. First operand 24229 states and 32756 transitions. Second operand has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:41:35,302 INFO L93 Difference]: Finished difference Result 255194 states and 344882 transitions. [2024-11-18 14:41:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2024-11-18 14:41:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-18 14:41:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:41:35,916 INFO L225 Difference]: With dead ends: 255194 [2024-11-18 14:41:35,916 INFO L226 Difference]: Without dead ends: 231001 [2024-11-18 14:41:36,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51499 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=23079, Invalid=86813, Unknown=0, NotChecked=0, Total=109892 [2024-11-18 14:41:36,025 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 5915 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 4293 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5915 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:41:36,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5915 Valid, 3132 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 4293 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-18 14:41:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231001 states. [2024-11-18 14:41:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231001 to 92781. [2024-11-18 14:41:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92781 states, 92780 states have (on average 1.3494503125673636) internal successors, (125202), 92780 states have internal predecessors, (125202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92781 states to 92781 states and 125202 transitions. [2024-11-18 14:41:40,978 INFO L78 Accepts]: Start accepts. Automaton has 92781 states and 125202 transitions. Word has length 66 [2024-11-18 14:41:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:41:40,978 INFO L471 AbstractCegarLoop]: Abstraction has 92781 states and 125202 transitions. [2024-11-18 14:41:40,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.977777777777778) internal successors, (179), 45 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:41:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 92781 states and 125202 transitions. [2024-11-18 14:41:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-18 14:41:40,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:41:40,985 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:41:41,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 14:41:41,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-18 14:41:41,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:41:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:41:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash 556898489, now seen corresponding path program 1 times [2024-11-18 14:41:41,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:41:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655197491] [2024-11-18 14:41:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:41:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:41:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:41:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:41:41,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:41:41,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655197491] [2024-11-18 14:41:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655197491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:41:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:41:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:41:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936147312] [2024-11-18 14:41:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:41:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:41:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:41:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:41:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:41:41,250 INFO L87 Difference]: Start difference. First operand 92781 states and 125202 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)