./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 6a855777f33fc48d84c4a45a2798e39789fc84161980bcc62efd5879691878c1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:49:59,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:49:59,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:49:59,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:49:59,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:49:59,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:49:59,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:49:59,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:49:59,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:49:59,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:49:59,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:49:59,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:49:59,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:49:59,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:49:59,527 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:49:59,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:49:59,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:49:59,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:49:59,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:49:59,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:49:59,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:49:59,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:49:59,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:49:59,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:49:59,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:49:59,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:49:59,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:49:59,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:49:59,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:49:59,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:49:59,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:49:59,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:49:59,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:49:59,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:49:59,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:49:59,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:49:59,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:49:59,540 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 -> 6a855777f33fc48d84c4a45a2798e39789fc84161980bcc62efd5879691878c1 [2024-11-19 22:49:59,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:49:59,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:49:59,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:49:59,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:49:59,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:49:59,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-19 22:50:01,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:50:01,481 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:50:01,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-19 22:50:01,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ee0e4af/52e5e481801b4be7919d13651c8fc182/FLAG2bcf32cff [2024-11-19 22:50:01,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1ee0e4af/52e5e481801b4be7919d13651c8fc182 [2024-11-19 22:50:01,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:50:01,838 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:50:01,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:50:01,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:50:01,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:50:01,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:50:01" (1/1) ... [2024-11-19 22:50:01,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fd9997f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:01, skipping insertion in model container [2024-11-19 22:50:01,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:50:01" (1/1) ... [2024-11-19 22:50:01,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:50:02,229 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-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2024-11-19 22:50:02,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:50:02,278 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:50:02,339 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-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[7401,7414] [2024-11-19 22:50:02,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:50:02,386 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:50:02,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02 WrapperNode [2024-11-19 22:50:02,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:50:02,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:50:02,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:50:02,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:50:02,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,448 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 683 [2024-11-19 22:50:02,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:50:02,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:50:02,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:50:02,449 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:50:02,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,488 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-19 22:50:02,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:50:02,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:50:02,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:50:02,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:50:02,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (1/1) ... [2024-11-19 22:50:02,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:50:02,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:50:02,548 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-19 22:50:02,557 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-19 22:50:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:50:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:50:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:50:02,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:50:02,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:50:02,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:50:03,487 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-19 22:50:03,488 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:50:03,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:50:03,500 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 22:50:03,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:50:03 BoogieIcfgContainer [2024-11-19 22:50:03,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:50:03,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:50:03,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:50:03,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:50:03,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:50:01" (1/3) ... [2024-11-19 22:50:03,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771cce5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:50:03, skipping insertion in model container [2024-11-19 22:50:03,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:50:02" (2/3) ... [2024-11-19 22:50:03,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771cce5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:50:03, skipping insertion in model container [2024-11-19 22:50:03,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:50:03" (3/3) ... [2024-11-19 22:50:03,508 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-19 22:50:03,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:50:03,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:50:03,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:50:03,580 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;@321693af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:50:03,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:50:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 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-19 22:50:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 22:50:03,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:03,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:03,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:03,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:03,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2011282842, now seen corresponding path program 1 times [2024-11-19 22:50:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:03,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124010380] [2024-11-19 22:50:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:04,053 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-19 22:50:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:04,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124010380] [2024-11-19 22:50:04,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124010380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:04,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:04,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:04,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13213875] [2024-11-19 22:50:04,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:04,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:04,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:04,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:04,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:04,083 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.6993865030674846) internal successors, (277), 164 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-19 22:50:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:04,148 INFO L93 Difference]: Finished difference Result 391 states and 633 transitions. [2024-11-19 22:50:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:04,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2024-11-19 22:50:04,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:04,169 INFO L225 Difference]: With dead ends: 391 [2024-11-19 22:50:04,169 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 22:50:04,172 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-19 22:50:04,175 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 205 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:04,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 592 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 22:50:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2024-11-19 22:50:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.5019157088122606) internal successors, (392), 261 states have internal predecessors, (392), 0 states have call successors, (0), 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-19 22:50:04,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2024-11-19 22:50:04,232 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 74 [2024-11-19 22:50:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:04,233 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2024-11-19 22:50:04,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-19 22:50:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2024-11-19 22:50:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:50:04,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:04,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:04,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:50:04,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:04,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash -141824057, now seen corresponding path program 1 times [2024-11-19 22:50:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749333869] [2024-11-19 22:50:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:04,386 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-19 22:50:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749333869] [2024-11-19 22:50:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749333869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:04,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:04,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608221730] [2024-11-19 22:50:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:04,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:04,392 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-19 22:50:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:04,426 INFO L93 Difference]: Finished difference Result 666 states and 1036 transitions. [2024-11-19 22:50:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2024-11-19 22:50:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:04,429 INFO L225 Difference]: With dead ends: 666 [2024-11-19 22:50:04,429 INFO L226 Difference]: Without dead ends: 448 [2024-11-19 22:50:04,430 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-19 22:50:04,430 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 166 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 520 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-19 22:50:04,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 520 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-19 22:50:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 446. [2024-11-19 22:50:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5393258426966292) internal successors, (685), 445 states have internal predecessors, (685), 0 states have call successors, (0), 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-19 22:50:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 685 transitions. [2024-11-19 22:50:04,452 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 685 transitions. Word has length 75 [2024-11-19 22:50:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:04,452 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 685 transitions. [2024-11-19 22:50:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-19 22:50:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 685 transitions. [2024-11-19 22:50:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 22:50:04,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:04,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:50:04,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:04,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash 890430339, now seen corresponding path program 1 times [2024-11-19 22:50:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:04,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173916108] [2024-11-19 22:50:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:04,584 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-19 22:50:04,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:04,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173916108] [2024-11-19 22:50:04,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173916108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:04,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:04,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925682495] [2024-11-19 22:50:04,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:04,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:04,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:04,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:04,588 INFO L87 Difference]: Start difference. First operand 446 states and 685 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-19 22:50:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:04,620 INFO L93 Difference]: Finished difference Result 1186 states and 1863 transitions. [2024-11-19 22:50:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2024-11-19 22:50:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:04,623 INFO L225 Difference]: With dead ends: 1186 [2024-11-19 22:50:04,623 INFO L226 Difference]: Without dead ends: 784 [2024-11-19 22:50:04,626 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-19 22:50:04,628 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 161 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 505 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-19 22:50:04,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 505 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:04,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-19 22:50:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 782. [2024-11-19 22:50:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 1.558258642765685) internal successors, (1217), 781 states have internal predecessors, (1217), 0 states have call successors, (0), 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-19 22:50:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1217 transitions. [2024-11-19 22:50:04,652 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1217 transitions. Word has length 76 [2024-11-19 22:50:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1217 transitions. [2024-11-19 22:50:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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-19 22:50:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1217 transitions. [2024-11-19 22:50:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 22:50:04,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:04,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:50:04,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:04,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash -806203398, now seen corresponding path program 1 times [2024-11-19 22:50:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323470043] [2024-11-19 22:50:04,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:04,756 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-19 22:50:04,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:04,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323470043] [2024-11-19 22:50:04,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323470043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:04,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:04,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283838001] [2024-11-19 22:50:04,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:04,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:04,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:04,758 INFO L87 Difference]: Start difference. First operand 782 states and 1217 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-19 22:50:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:04,784 INFO L93 Difference]: Finished difference Result 2130 states and 3355 transitions. [2024-11-19 22:50:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-19 22:50:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:04,790 INFO L225 Difference]: With dead ends: 2130 [2024-11-19 22:50:04,791 INFO L226 Difference]: Without dead ends: 1392 [2024-11-19 22:50:04,792 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-19 22:50:04,795 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 156 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 490 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-19 22:50:04,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 490 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-11-19 22:50:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2024-11-19 22:50:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.564434845212383) internal successors, (2173), 1389 states have internal predecessors, (2173), 0 states have call successors, (0), 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-19 22:50:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2173 transitions. [2024-11-19 22:50:04,836 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2173 transitions. Word has length 77 [2024-11-19 22:50:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2173 transitions. [2024-11-19 22:50:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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-19 22:50:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2173 transitions. [2024-11-19 22:50:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 22:50:04,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:04,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:50:04,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash -904090240, now seen corresponding path program 1 times [2024-11-19 22:50:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983325465] [2024-11-19 22:50:04,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:04,941 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-19 22:50:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983325465] [2024-11-19 22:50:04,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983325465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:04,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:04,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073861763] [2024-11-19 22:50:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:04,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:04,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:04,946 INFO L87 Difference]: Start difference. First operand 1390 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-19 22:50:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:04,975 INFO L93 Difference]: Finished difference Result 3826 states and 6015 transitions. [2024-11-19 22:50:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:04,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-19 22:50:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:04,984 INFO L225 Difference]: With dead ends: 3826 [2024-11-19 22:50:04,984 INFO L226 Difference]: Without dead ends: 2480 [2024-11-19 22:50:04,986 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-19 22:50:04,987 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 151 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 475 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-19 22:50:04,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 475 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2024-11-19 22:50:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2478. [2024-11-19 22:50:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.5619701251513929) internal successors, (3869), 2477 states have internal predecessors, (3869), 0 states have call successors, (0), 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-19 22:50:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3869 transitions. [2024-11-19 22:50:05,047 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3869 transitions. Word has length 78 [2024-11-19 22:50:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:05,048 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3869 transitions. [2024-11-19 22:50:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 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-19 22:50:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3869 transitions. [2024-11-19 22:50:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 22:50:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:05,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:50:05,050 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:05,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1797609537, now seen corresponding path program 1 times [2024-11-19 22:50:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:05,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913870733] [2024-11-19 22:50:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:05,262 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-19 22:50:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913870733] [2024-11-19 22:50:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913870733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:50:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655838692] [2024-11-19 22:50:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:05,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:50:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:50:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:50:05,266 INFO L87 Difference]: Start difference. First operand 2478 states and 3869 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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-19 22:50:05,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:05,556 INFO L93 Difference]: Finished difference Result 19516 states and 30644 transitions. [2024-11-19 22:50:05,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:50:05,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-19 22:50:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:05,617 INFO L225 Difference]: With dead ends: 19516 [2024-11-19 22:50:05,618 INFO L226 Difference]: Without dead ends: 17082 [2024-11-19 22:50:05,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-19 22:50:05,633 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 2601 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2601 SdHoareTripleChecker+Valid, 3272 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:05,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2601 Valid, 3272 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:50:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17082 states. [2024-11-19 22:50:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17082 to 4910. [2024-11-19 22:50:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4910 states, 4909 states have (on average 1.5540843348950906) internal successors, (7629), 4909 states have internal predecessors, (7629), 0 states have call successors, (0), 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-19 22:50:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 7629 transitions. [2024-11-19 22:50:05,875 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 7629 transitions. Word has length 79 [2024-11-19 22:50:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 4910 states and 7629 transitions. [2024-11-19 22:50:05,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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-19 22:50:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 7629 transitions. [2024-11-19 22:50:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 22:50:05,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:05,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 22:50:05,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash -128135395, now seen corresponding path program 1 times [2024-11-19 22:50:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:05,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332907453] [2024-11-19 22:50:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:05,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:06,115 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-19 22:50:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:06,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332907453] [2024-11-19 22:50:06,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332907453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:06,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:06,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 22:50:06,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479996683] [2024-11-19 22:50:06,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:06,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:50:06,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:50:06,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:50:06,118 INFO L87 Difference]: Start difference. First operand 4910 states and 7629 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-19 22:50:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:06,354 INFO L93 Difference]: Finished difference Result 30106 states and 46547 transitions. [2024-11-19 22:50:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:50:06,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-19 22:50:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:06,425 INFO L225 Difference]: With dead ends: 30106 [2024-11-19 22:50:06,426 INFO L226 Difference]: Without dead ends: 25240 [2024-11-19 22:50:06,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:50:06,445 INFO L432 NwaCegarLoop]: 674 mSDtfsCounter, 1038 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:06,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1738 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:50:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25240 states. [2024-11-19 22:50:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25240 to 25230. [2024-11-19 22:50:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25230 states, 25229 states have (on average 1.54159895358516) internal successors, (38893), 25229 states have internal predecessors, (38893), 0 states have call successors, (0), 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-19 22:50:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25230 states to 25230 states and 38893 transitions. [2024-11-19 22:50:06,908 INFO L78 Accepts]: Start accepts. Automaton has 25230 states and 38893 transitions. Word has length 80 [2024-11-19 22:50:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 25230 states and 38893 transitions. [2024-11-19 22:50:06,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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-19 22:50:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 25230 states and 38893 transitions. [2024-11-19 22:50:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 22:50:06,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:06,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:50:06,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 750877787, now seen corresponding path program 1 times [2024-11-19 22:50:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865675559] [2024-11-19 22:50:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:06,970 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-19 22:50:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865675559] [2024-11-19 22:50:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865675559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:06,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:06,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:06,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632961054] [2024-11-19 22:50:06,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:06,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:06,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:06,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:06,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:06,972 INFO L87 Difference]: Start difference. First operand 25230 states and 38893 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 22:50:07,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:07,252 INFO L93 Difference]: Finished difference Result 69010 states and 105967 transitions. [2024-11-19 22:50:07,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:07,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-19 22:50:07,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:07,323 INFO L225 Difference]: With dead ends: 69010 [2024-11-19 22:50:07,323 INFO L226 Difference]: Without dead ends: 43824 [2024-11-19 22:50:07,358 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-19 22:50:07,359 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 173 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 560 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-19 22:50:07,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 560 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43824 states. [2024-11-19 22:50:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43824 to 43822. [2024-11-19 22:50:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43822 states, 43821 states have (on average 1.5228543392437417) internal successors, (66733), 43821 states have internal predecessors, (66733), 0 states have call successors, (0), 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-19 22:50:08,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43822 states to 43822 states and 66733 transitions. [2024-11-19 22:50:08,607 INFO L78 Accepts]: Start accepts. Automaton has 43822 states and 66733 transitions. Word has length 81 [2024-11-19 22:50:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 43822 states and 66733 transitions. [2024-11-19 22:50:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-19 22:50:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 43822 states and 66733 transitions. [2024-11-19 22:50:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:50:08,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:08,608 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:08,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:50:08,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:08,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1315274732, now seen corresponding path program 1 times [2024-11-19 22:50:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047287769] [2024-11-19 22:50:08,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:08,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:08,939 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-19 22:50:08,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:08,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047287769] [2024-11-19 22:50:08,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047287769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:08,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:08,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:50:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902241574] [2024-11-19 22:50:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:50:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:50:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:50:08,945 INFO L87 Difference]: Start difference. First operand 43822 states and 66733 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:50:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:09,688 INFO L93 Difference]: Finished difference Result 131378 states and 200111 transitions. [2024-11-19 22:50:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:50:09,689 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:50:09,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:09,870 INFO L225 Difference]: With dead ends: 131378 [2024-11-19 22:50:09,871 INFO L226 Difference]: Without dead ends: 87600 [2024-11-19 22:50:09,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-19 22:50:09,927 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1006 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:09,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 260 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:50:09,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87600 states. [2024-11-19 22:50:11,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87600 to 87598. [2024-11-19 22:50:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87598 states, 87597 states have (on average 1.5150861330867496) internal successors, (132717), 87597 states have internal predecessors, (132717), 0 states have call successors, (0), 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-19 22:50:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87598 states to 87598 states and 132717 transitions. [2024-11-19 22:50:11,500 INFO L78 Accepts]: Start accepts. Automaton has 87598 states and 132717 transitions. Word has length 82 [2024-11-19 22:50:11,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:11,500 INFO L471 AbstractCegarLoop]: Abstraction has 87598 states and 132717 transitions. [2024-11-19 22:50:11,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:50:11,500 INFO L276 IsEmpty]: Start isEmpty. Operand 87598 states and 132717 transitions. [2024-11-19 22:50:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 22:50:11,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:11,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:11,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:50:11,506 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1885691313, now seen corresponding path program 1 times [2024-11-19 22:50:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508401193] [2024-11-19 22:50:11,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:11,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:11,942 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-19 22:50:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508401193] [2024-11-19 22:50:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508401193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:50:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800047200] [2024-11-19 22:50:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:50:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:50:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:50:11,944 INFO L87 Difference]: Start difference. First operand 87598 states and 132717 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:50:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:12,136 INFO L93 Difference]: Finished difference Result 90672 states and 137326 transitions. [2024-11-19 22:50:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:50:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-19 22:50:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:12,421 INFO L225 Difference]: With dead ends: 90672 [2024-11-19 22:50:12,421 INFO L226 Difference]: Without dead ends: 90670 [2024-11-19 22:50:12,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-19 22:50:12,436 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:12,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 906 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:12,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90670 states. [2024-11-19 22:50:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90670 to 90670. [2024-11-19 22:50:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90670 states, 90669 states have (on average 1.4976342520596897) internal successors, (135789), 90669 states have internal predecessors, (135789), 0 states have call successors, (0), 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-19 22:50:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90670 states to 90670 states and 135789 transitions. [2024-11-19 22:50:14,065 INFO L78 Accepts]: Start accepts. Automaton has 90670 states and 135789 transitions. Word has length 82 [2024-11-19 22:50:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 90670 states and 135789 transitions. [2024-11-19 22:50:14,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:50:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90670 states and 135789 transitions. [2024-11-19 22:50:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 22:50:14,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:14,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:14,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:50:14,066 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:14,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:14,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1683684575, now seen corresponding path program 1 times [2024-11-19 22:50:14,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:14,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365382627] [2024-11-19 22:50:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:14,135 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-19 22:50:14,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365382627] [2024-11-19 22:50:14,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365382627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:50:14,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:50:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:50:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993444011] [2024-11-19 22:50:14,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:50:14,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:50:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:50:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:50:14,137 INFO L87 Difference]: Start difference. First operand 90670 states and 135789 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 22:50:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:14,546 INFO L93 Difference]: Finished difference Result 202900 states and 303393 transitions. [2024-11-19 22:50:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:50:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-19 22:50:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:15,242 INFO L225 Difference]: With dead ends: 202900 [2024-11-19 22:50:15,242 INFO L226 Difference]: Without dead ends: 112274 [2024-11-19 22:50:15,309 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-19 22:50:15,310 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 138 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:15,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 414 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:50:15,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112274 states. [2024-11-19 22:50:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112274 to 111920. [2024-11-19 22:50:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111920 states, 111919 states have (on average 1.4884961445330998) internal successors, (166591), 111919 states have internal predecessors, (166591), 0 states have call successors, (0), 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-19 22:50:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111920 states to 111920 states and 166591 transitions. [2024-11-19 22:50:17,345 INFO L78 Accepts]: Start accepts. Automaton has 111920 states and 166591 transitions. Word has length 83 [2024-11-19 22:50:17,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:50:17,346 INFO L471 AbstractCegarLoop]: Abstraction has 111920 states and 166591 transitions. [2024-11-19 22:50:17,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-19 22:50:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111920 states and 166591 transitions. [2024-11-19 22:50:17,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 22:50:17,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:50:17,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:50:17,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:50:17,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:50:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:50:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 967908386, now seen corresponding path program 1 times [2024-11-19 22:50:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:50:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843320051] [2024-11-19 22:50:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:50:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:50:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:50:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843320051] [2024-11-19 22:50:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843320051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:50:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187562615] [2024-11-19 22:50:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:50:17,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:50:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:50:17,812 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-19 22:50:17,815 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-19 22:50:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:50:17,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 22:50:17,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:50:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:50:18,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:50:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:50:19,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187562615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:50:19,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:50:19,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2024-11-19 22:50:19,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471698681] [2024-11-19 22:50:19,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:50:19,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 22:50:19,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:50:19,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 22:50:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-19 22:50:19,782 INFO L87 Difference]: Start difference. First operand 111920 states and 166591 transitions. Second operand has 23 states, 23 states have (on average 14.478260869565217) internal successors, (333), 23 states have internal predecessors, (333), 0 states have call successors, (0), 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-19 22:50:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:50:36,330 INFO L93 Difference]: Finished difference Result 1278792 states and 1893714 transitions. [2024-11-19 22:50:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2024-11-19 22:50:36,331 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.478260869565217) internal successors, (333), 23 states have internal predecessors, (333), 0 states have call successors, (0), 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 114 [2024-11-19 22:50:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:50:38,915 INFO L225 Difference]: With dead ends: 1278792 [2024-11-19 22:50:38,915 INFO L226 Difference]: Without dead ends: 1166918 [2024-11-19 22:50:39,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11577 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4736, Invalid=23994, Unknown=0, NotChecked=0, Total=28730 [2024-11-19 22:50:39,207 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 25287 mSDsluCounter, 4944 mSDsCounter, 0 mSdLazyCounter, 5135 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25287 SdHoareTripleChecker+Valid, 5411 SdHoareTripleChecker+Invalid, 5321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 5135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-19 22:50:39,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25287 Valid, 5411 Invalid, 5321 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [186 Valid, 5135 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-19 22:50:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166918 states. [2024-11-19 22:50:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166918 to 860265. [2024-11-19 22:50:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860265 states, 860264 states have (on average 1.4686607832014358) internal successors, (1263436), 860264 states have internal predecessors, (1263436), 0 states have call successors, (0), 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-19 22:51:00,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860265 states to 860265 states and 1263436 transitions. [2024-11-19 22:51:00,929 INFO L78 Accepts]: Start accepts. Automaton has 860265 states and 1263436 transitions. Word has length 114 [2024-11-19 22:51:00,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:51:00,930 INFO L471 AbstractCegarLoop]: Abstraction has 860265 states and 1263436 transitions. [2024-11-19 22:51:00,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.478260869565217) internal successors, (333), 23 states have internal predecessors, (333), 0 states have call successors, (0), 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-19 22:51:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 860265 states and 1263436 transitions. [2024-11-19 22:51:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 22:51:01,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:51:01,007 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:51:01,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:51:01,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-19 22:51:01,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:51:01,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:51:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 726750180, now seen corresponding path program 1 times [2024-11-19 22:51:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:51:01,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771477341] [2024-11-19 22:51:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:51:01,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:51:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:51:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:51:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:51:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771477341] [2024-11-19 22:51:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771477341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:51:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:51:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:51:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784799679] [2024-11-19 22:51:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:51:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:51:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:51:01,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:51:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:51:01,292 INFO L87 Difference]: Start difference. First operand 860265 states and 1263436 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)