./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label02.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 adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:37:14,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:37:14,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:37:14,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:37:14,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:37:14,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:37:14,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:37:14,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:37:14,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:37:14,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:37:14,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:37:14,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:37:14,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:37:14,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:37:14,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:37:14,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:37:14,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:37:14,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:37:14,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:37:14,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:37:14,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:37:14,718 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:37:14,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:37:14,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:37:14,719 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:37:14,719 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:37:14,719 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:37:14,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:37:14,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:37:14,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:37:14,720 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:37:14,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:37:14,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:37:14,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:37:14,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:37:14,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:37:14,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:37:14,723 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 -> adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 [2024-11-08 11:37:14,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:37:14,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:37:14,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:37:14,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:37:14,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:37:14,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-11-08 11:37:16,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:37:16,474 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:37:16,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2024-11-08 11:37:16,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575c4c3ce/f3add3232f1a42ecb94d1f196bb3a45c/FLAG66bb8aff7 [2024-11-08 11:37:16,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575c4c3ce/f3add3232f1a42ecb94d1f196bb3a45c [2024-11-08 11:37:16,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:37:16,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:37:16,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:37:16,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:37:16,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:37:16,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:37:16" (1/1) ... [2024-11-08 11:37:16,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@202ddd26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:16, skipping insertion in model container [2024-11-08 11:37:16,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:37:16" (1/1) ... [2024-11-08 11:37:16,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:37:16,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c[7859,7872] [2024-11-08 11:37:17,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:37:17,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:37:17,206 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c[7859,7872] [2024-11-08 11:37:17,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:37:17,437 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:37:17,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17 WrapperNode [2024-11-08 11:37:17,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:37:17,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:37:17,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:37:17,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:37:17,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,708 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-08 11:37:17,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:37:17,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:37:17,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:37:17,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:37:17,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 11:37:17,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:17,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:18,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:37:18,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:37:18,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:37:18,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:37:18,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (1/1) ... [2024-11-08 11:37:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:37:18,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:18,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 11:37:18,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 11:37:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:37:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:37:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:37:18,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:37:18,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:37:18,126 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:37:20,351 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-08 11:37:20,352 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:37:20,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:37:20,396 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:37:20,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:37:20 BoogieIcfgContainer [2024-11-08 11:37:20,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:37:20,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:37:20,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:37:20,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:37:20,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:37:16" (1/3) ... [2024-11-08 11:37:20,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc874a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:37:20, skipping insertion in model container [2024-11-08 11:37:20,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:37:17" (2/3) ... [2024-11-08 11:37:20,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5afc874a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:37:20, skipping insertion in model container [2024-11-08 11:37:20,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:37:20" (3/3) ... [2024-11-08 11:37:20,404 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label02.c [2024-11-08 11:37:20,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:37:20,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:37:20,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:37:20,501 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;@5d77b7ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:37:20,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:37:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 11:37:20,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:20,515 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] [2024-11-08 11:37:20,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash -92557335, now seen corresponding path program 1 times [2024-11-08 11:37:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179874741] [2024-11-08 11:37:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:20,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179874741] [2024-11-08 11:37:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179874741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:20,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:20,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955316223] [2024-11-08 11:37:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:20,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:20,868 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:22,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:22,797 INFO L93 Difference]: Finished difference Result 1644 states and 3029 transitions. [2024-11-08 11:37:22,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-11-08 11:37:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:22,812 INFO L225 Difference]: With dead ends: 1644 [2024-11-08 11:37:22,812 INFO L226 Difference]: Without dead ends: 977 [2024-11-08 11:37:22,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:22,818 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 435 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:22,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 11:37:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-08 11:37:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2024-11-08 11:37:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2024-11-08 11:37:22,920 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 53 [2024-11-08 11:37:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:22,921 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2024-11-08 11:37:22,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2024-11-08 11:37:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 11:37:22,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:22,925 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:22,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:37:22,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:22,926 INFO L85 PathProgramCache]: Analyzing trace with hash -10640398, now seen corresponding path program 1 times [2024-11-08 11:37:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614671477] [2024-11-08 11:37:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614671477] [2024-11-08 11:37:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614671477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899284409] [2024-11-08 11:37:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:23,099 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:24,777 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2024-11-08 11:37:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:24,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-08 11:37:24,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:24,784 INFO L225 Difference]: With dead ends: 2813 [2024-11-08 11:37:24,784 INFO L226 Difference]: Without dead ends: 1844 [2024-11-08 11:37:24,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:24,789 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:24,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:37:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-08 11:37:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2024-11-08 11:37:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2024-11-08 11:37:24,823 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 120 [2024-11-08 11:37:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:24,825 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2024-11-08 11:37:24,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:24,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2024-11-08 11:37:24,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 11:37:24,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:24,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:24,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:37:24,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:24,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash -703297284, now seen corresponding path program 1 times [2024-11-08 11:37:24,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:24,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886419649] [2024-11-08 11:37:24,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886419649] [2024-11-08 11:37:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886419649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:25,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181486131] [2024-11-08 11:37:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:25,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:25,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:25,111 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:27,665 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2024-11-08 11:37:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:27,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-08 11:37:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:27,678 INFO L225 Difference]: With dead ends: 6765 [2024-11-08 11:37:27,679 INFO L226 Difference]: Without dead ends: 4926 [2024-11-08 11:37:27,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:27,684 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 859 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:27,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 329 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 11:37:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2024-11-08 11:37:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2024-11-08 11:37:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2024-11-08 11:37:27,746 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 123 [2024-11-08 11:37:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2024-11-08 11:37:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2024-11-08 11:37:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 11:37:27,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:27,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:27,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:37:27,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1839715273, now seen corresponding path program 1 times [2024-11-08 11:37:27,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:27,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983378143] [2024-11-08 11:37:27,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-08 11:37:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:27,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983378143] [2024-11-08 11:37:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983378143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:37:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571568529] [2024-11-08 11:37:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:27,914 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:29,352 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2024-11-08 11:37:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 194 [2024-11-08 11:37:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:29,371 INFO L225 Difference]: With dead ends: 14436 [2024-11-08 11:37:29,371 INFO L226 Difference]: Without dead ends: 8277 [2024-11-08 11:37:29,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:29,378 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 549 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 549 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:29,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [549 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:37:29,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2024-11-08 11:37:29,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2024-11-08 11:37:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2024-11-08 11:37:29,459 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 194 [2024-11-08 11:37:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2024-11-08 11:37:29,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2024-11-08 11:37:29,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 11:37:29,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:29,463 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:29,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:37:29,464 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:29,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1977125269, now seen corresponding path program 1 times [2024-11-08 11:37:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572046660] [2024-11-08 11:37:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:29,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 11:37:29,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572046660] [2024-11-08 11:37:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572046660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:29,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:29,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017075849] [2024-11-08 11:37:29,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:29,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:29,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:29,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:29,611 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:31,003 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2024-11-08 11:37:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:31,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 207 [2024-11-08 11:37:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:31,023 INFO L225 Difference]: With dead ends: 15692 [2024-11-08 11:37:31,023 INFO L226 Difference]: Without dead ends: 9547 [2024-11-08 11:37:31,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:31,030 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:31,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:37:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2024-11-08 11:37:31,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2024-11-08 11:37:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2024-11-08 11:37:31,113 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 207 [2024-11-08 11:37:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:31,114 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2024-11-08 11:37:31,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2024-11-08 11:37:31,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 11:37:31,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:31,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:31,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:37:31,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:31,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1027746944, now seen corresponding path program 1 times [2024-11-08 11:37:31,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334283897] [2024-11-08 11:37:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:37:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:31,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334283897] [2024-11-08 11:37:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334283897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:31,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:31,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:31,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623257823] [2024-11-08 11:37:31,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:31,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:31,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:31,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:31,266 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:32,593 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2024-11-08 11:37:32,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2024-11-08 11:37:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:32,618 INFO L225 Difference]: With dead ends: 16078 [2024-11-08 11:37:32,618 INFO L226 Difference]: Without dead ends: 9956 [2024-11-08 11:37:32,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:32,623 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:32,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:37:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2024-11-08 11:37:32,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2024-11-08 11:37:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2024-11-08 11:37:32,728 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 214 [2024-11-08 11:37:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:32,729 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2024-11-08 11:37:32,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2024-11-08 11:37:32,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-11-08 11:37:32,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:32,731 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:32,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:37:32,732 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:32,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash 173331966, now seen corresponding path program 1 times [2024-11-08 11:37:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:32,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026950949] [2024-11-08 11:37:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:33,054 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:37:33,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026950949] [2024-11-08 11:37:33,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026950949] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:33,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274811168] [2024-11-08 11:37:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:33,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:33,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:37:33,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 11:37:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:33,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 11:37:33,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:37:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:37:33,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:37:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:37:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274811168] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:37:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-08 11:37:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549512886] [2024-11-08 11:37:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:33,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:33,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:33,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:33,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:33,666 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:36,057 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2024-11-08 11:37:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:36,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 277 [2024-11-08 11:37:36,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:36,085 INFO L225 Difference]: With dead ends: 30575 [2024-11-08 11:37:36,085 INFO L226 Difference]: Without dead ends: 19763 [2024-11-08 11:37:36,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:37:36,096 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:36,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 162 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:37:36,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2024-11-08 11:37:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2024-11-08 11:37:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:36,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2024-11-08 11:37:36,327 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 277 [2024-11-08 11:37:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:36,327 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2024-11-08 11:37:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2024-11-08 11:37:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-08 11:37:36,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:36,331 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:36,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 11:37:36,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:36,532 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:36,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:36,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1525566454, now seen corresponding path program 1 times [2024-11-08 11:37:36,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034765183] [2024-11-08 11:37:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:37:36,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:36,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034765183] [2024-11-08 11:37:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034765183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:36,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130521736] [2024-11-08 11:37:36,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:36,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:36,697 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:38,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:38,030 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2024-11-08 11:37:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:38,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 290 [2024-11-08 11:37:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:38,057 INFO L225 Difference]: With dead ends: 42909 [2024-11-08 11:37:38,057 INFO L226 Difference]: Without dead ends: 23151 [2024-11-08 11:37:38,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:38,073 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 374 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:38,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:37:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23151 states. [2024-11-08 11:37:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 22725. [2024-11-08 11:37:38,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1456169688435134) internal successors, (26033), 22724 states have internal predecessors, (26033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 26033 transitions. [2024-11-08 11:37:38,250 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 26033 transitions. Word has length 290 [2024-11-08 11:37:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 26033 transitions. [2024-11-08 11:37:38,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 26033 transitions. [2024-11-08 11:37:38,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-08 11:37:38,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:38,254 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:38,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:37:38,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:38,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:38,255 INFO L85 PathProgramCache]: Analyzing trace with hash -162552321, now seen corresponding path program 1 times [2024-11-08 11:37:38,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:38,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976014168] [2024-11-08 11:37:38,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:37:38,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976014168] [2024-11-08 11:37:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976014168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:38,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:38,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:37:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970563756] [2024-11-08 11:37:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:38,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:38,598 INFO L87 Difference]: Start difference. First operand 22725 states and 26033 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:41,013 INFO L93 Difference]: Finished difference Result 64237 states and 73654 transitions. [2024-11-08 11:37:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:41,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 313 [2024-11-08 11:37:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:41,056 INFO L225 Difference]: With dead ends: 64237 [2024-11-08 11:37:41,056 INFO L226 Difference]: Without dead ends: 38101 [2024-11-08 11:37:41,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:37:41,080 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 854 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:41,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 371 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:37:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38101 states. [2024-11-08 11:37:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38101 to 37204. [2024-11-08 11:37:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37204 states, 37203 states have (on average 1.137462032631777) internal successors, (42317), 37203 states have internal predecessors, (42317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 42317 transitions. [2024-11-08 11:37:41,437 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 42317 transitions. Word has length 313 [2024-11-08 11:37:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:41,437 INFO L471 AbstractCegarLoop]: Abstraction has 37204 states and 42317 transitions. [2024-11-08 11:37:41,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 42317 transitions. [2024-11-08 11:37:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-08 11:37:41,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:41,442 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:41,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:37:41,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:41,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash -769673228, now seen corresponding path program 1 times [2024-11-08 11:37:41,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744041788] [2024-11-08 11:37:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:41,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:37:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:41,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744041788] [2024-11-08 11:37:41,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744041788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:41,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:41,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:41,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766162552] [2024-11-08 11:37:41,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:41,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:41,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:41,638 INFO L87 Difference]: Start difference. First operand 37204 states and 42317 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:43,269 INFO L93 Difference]: Finished difference Result 90182 states and 102746 transitions. [2024-11-08 11:37:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 328 [2024-11-08 11:37:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:43,323 INFO L225 Difference]: With dead ends: 90182 [2024-11-08 11:37:43,323 INFO L226 Difference]: Without dead ends: 51278 [2024-11-08 11:37:43,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:43,350 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 363 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:43,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 824 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:37:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2024-11-08 11:37:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 49991. [2024-11-08 11:37:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49991 states, 49990 states have (on average 1.1124624924984996) internal successors, (55612), 49990 states have internal predecessors, (55612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49991 states to 49991 states and 55612 transitions. [2024-11-08 11:37:43,867 INFO L78 Accepts]: Start accepts. Automaton has 49991 states and 55612 transitions. Word has length 328 [2024-11-08 11:37:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:43,867 INFO L471 AbstractCegarLoop]: Abstraction has 49991 states and 55612 transitions. [2024-11-08 11:37:43,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand 49991 states and 55612 transitions. [2024-11-08 11:37:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-08 11:37:43,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:43,873 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:43,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:37:43,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:43,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:43,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1314932159, now seen corresponding path program 1 times [2024-11-08 11:37:43,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:43,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168813711] [2024-11-08 11:37:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:43,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 361 proven. 214 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-08 11:37:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168813711] [2024-11-08 11:37:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168813711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707792336] [2024-11-08 11:37:44,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:37:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:37:44,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:37:44,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 11:37:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:44,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 11:37:44,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:37:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 381 proven. 73 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-08 11:37:44,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:37:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-08 11:37:44,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707792336] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:37:44,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:37:44,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2024-11-08 11:37:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182429426] [2024-11-08 11:37:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:44,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:37:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:37:44,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:37:44,745 INFO L87 Difference]: Start difference. First operand 49991 states and 55612 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:47,020 INFO L93 Difference]: Finished difference Result 118728 states and 132318 transitions. [2024-11-08 11:37:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:37:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 351 [2024-11-08 11:37:47,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:47,088 INFO L225 Difference]: With dead ends: 118728 [2024-11-08 11:37:47,088 INFO L226 Difference]: Without dead ends: 68739 [2024-11-08 11:37:47,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 11:37:47,114 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:47,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 199 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 11:37:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68739 states. [2024-11-08 11:37:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 64908. [2024-11-08 11:37:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64908 states, 64907 states have (on average 1.1170597932426394) internal successors, (72505), 64907 states have internal predecessors, (72505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64908 states to 64908 states and 72505 transitions. [2024-11-08 11:37:47,895 INFO L78 Accepts]: Start accepts. Automaton has 64908 states and 72505 transitions. Word has length 351 [2024-11-08 11:37:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:47,896 INFO L471 AbstractCegarLoop]: Abstraction has 64908 states and 72505 transitions. [2024-11-08 11:37:47,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 64908 states and 72505 transitions. [2024-11-08 11:37:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-08 11:37:47,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:47,903 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:47,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 11:37:48,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 11:37:48,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:48,105 INFO L85 PathProgramCache]: Analyzing trace with hash -444093731, now seen corresponding path program 1 times [2024-11-08 11:37:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330835702] [2024-11-08 11:37:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-08 11:37:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330835702] [2024-11-08 11:37:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330835702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:48,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:48,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639716960] [2024-11-08 11:37:48,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:48,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:48,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:48,567 INFO L87 Difference]: Start difference. First operand 64908 states and 72505 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:50,212 INFO L93 Difference]: Finished difference Result 142175 states and 159014 transitions. [2024-11-08 11:37:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 365 [2024-11-08 11:37:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:50,288 INFO L225 Difference]: With dead ends: 142175 [2024-11-08 11:37:50,288 INFO L226 Difference]: Without dead ends: 76831 [2024-11-08 11:37:50,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:50,388 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 470 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:50,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 301 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:37:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76831 states. [2024-11-08 11:37:51,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76831 to 73417. [2024-11-08 11:37:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73417 states, 73416 states have (on average 1.1121009044350005) internal successors, (81646), 73416 states have internal predecessors, (81646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73417 states to 73417 states and 81646 transitions. [2024-11-08 11:37:51,253 INFO L78 Accepts]: Start accepts. Automaton has 73417 states and 81646 transitions. Word has length 365 [2024-11-08 11:37:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:51,253 INFO L471 AbstractCegarLoop]: Abstraction has 73417 states and 81646 transitions. [2024-11-08 11:37:51,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 73417 states and 81646 transitions. [2024-11-08 11:37:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-08 11:37:51,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:51,258 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:51,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:37:51,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:51,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2004060531, now seen corresponding path program 1 times [2024-11-08 11:37:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704665452] [2024-11-08 11:37:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-11-08 11:37:51,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:51,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704665452] [2024-11-08 11:37:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704665452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:51,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:51,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:51,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716082502] [2024-11-08 11:37:51,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:51,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:51,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:51,752 INFO L87 Difference]: Start difference. First operand 73417 states and 81646 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:53,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:53,300 INFO L93 Difference]: Finished difference Result 162999 states and 181520 transitions. [2024-11-08 11:37:53,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 381 [2024-11-08 11:37:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:53,386 INFO L225 Difference]: With dead ends: 162999 [2024-11-08 11:37:53,386 INFO L226 Difference]: Without dead ends: 88307 [2024-11-08 11:37:53,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:53,427 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 388 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:53,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 819 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:37:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88307 states. [2024-11-08 11:37:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88307 to 72956. [2024-11-08 11:37:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72956 states, 72955 states have (on average 1.110931396066068) internal successors, (81048), 72955 states have internal predecessors, (81048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72956 states to 72956 states and 81048 transitions. [2024-11-08 11:37:54,312 INFO L78 Accepts]: Start accepts. Automaton has 72956 states and 81048 transitions. Word has length 381 [2024-11-08 11:37:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:54,312 INFO L471 AbstractCegarLoop]: Abstraction has 72956 states and 81048 transitions. [2024-11-08 11:37:54,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 72956 states and 81048 transitions. [2024-11-08 11:37:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-08 11:37:54,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:54,317 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 11:37:54,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:54,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1666713624, now seen corresponding path program 1 times [2024-11-08 11:37:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:54,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333656090] [2024-11-08 11:37:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-08 11:37:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333656090] [2024-11-08 11:37:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333656090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:54,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:54,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:54,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743765193] [2024-11-08 11:37:54,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:54,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:54,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:54,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:54,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:54,664 INFO L87 Difference]: Start difference. First operand 72956 states and 81048 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:56,377 INFO L93 Difference]: Finished difference Result 166351 states and 185065 transitions. [2024-11-08 11:37:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 399 [2024-11-08 11:37:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:56,461 INFO L225 Difference]: With dead ends: 166351 [2024-11-08 11:37:56,461 INFO L226 Difference]: Without dead ends: 92967 [2024-11-08 11:37:56,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:56,483 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 409 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:56,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 362 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:37:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92967 states. [2024-11-08 11:37:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92967 to 88269. [2024-11-08 11:37:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88269 states, 88268 states have (on average 1.1048964517152309) internal successors, (97527), 88268 states have internal predecessors, (97527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88269 states to 88269 states and 97527 transitions. [2024-11-08 11:37:57,469 INFO L78 Accepts]: Start accepts. Automaton has 88269 states and 97527 transitions. Word has length 399 [2024-11-08 11:37:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:37:57,470 INFO L471 AbstractCegarLoop]: Abstraction has 88269 states and 97527 transitions. [2024-11-08 11:37:57,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 88269 states and 97527 transitions. [2024-11-08 11:37:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-08 11:37:57,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:37:57,474 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:37:57,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:37:57,474 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:37:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:37:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1497264050, now seen corresponding path program 1 times [2024-11-08 11:37:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:37:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044678607] [2024-11-08 11:37:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:37:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:37:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:37:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2024-11-08 11:37:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:37:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044678607] [2024-11-08 11:37:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044678607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:37:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:37:57,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:37:57,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650494303] [2024-11-08 11:37:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:37:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:37:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:37:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:37:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:57,603 INFO L87 Difference]: Start difference. First operand 88269 states and 97527 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:37:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:37:59,184 INFO L93 Difference]: Finished difference Result 185041 states and 203999 transitions. [2024-11-08 11:37:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:37:59,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 403 [2024-11-08 11:37:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:37:59,293 INFO L225 Difference]: With dead ends: 185041 [2024-11-08 11:37:59,293 INFO L226 Difference]: Without dead ends: 96773 [2024-11-08 11:37:59,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:37:59,353 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 388 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:37:59,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 315 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:37:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96773 states. [2024-11-08 11:38:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96773 to 91667. [2024-11-08 11:38:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91667 states, 91666 states have (on average 1.1008989156284772) internal successors, (100915), 91666 states have internal predecessors, (100915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91667 states to 91667 states and 100915 transitions. [2024-11-08 11:38:00,624 INFO L78 Accepts]: Start accepts. Automaton has 91667 states and 100915 transitions. Word has length 403 [2024-11-08 11:38:00,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:00,624 INFO L471 AbstractCegarLoop]: Abstraction has 91667 states and 100915 transitions. [2024-11-08 11:38:00,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 91667 states and 100915 transitions. [2024-11-08 11:38:00,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-08 11:38:00,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:00,629 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:00,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:38:00,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:00,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1444998463, now seen corresponding path program 1 times [2024-11-08 11:38:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921083402] [2024-11-08 11:38:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-08 11:38:01,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921083402] [2024-11-08 11:38:01,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921083402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:38:01,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883092983] [2024-11-08 11:38:01,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:01,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:38:01,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:38:01,225 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:38:01,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 11:38:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:01,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:38:01,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:38:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-08 11:38:01,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:38:02,402 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-08 11:38:02,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883092983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:38:02,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:38:02,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-08 11:38:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870760177] [2024-11-08 11:38:02,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:38:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 11:38:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 11:38:02,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 11:38:02,405 INFO L87 Difference]: Start difference. First operand 91667 states and 100915 transitions. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:09,595 INFO L93 Difference]: Finished difference Result 236565 states and 258883 transitions. [2024-11-08 11:38:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 11:38:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 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 433 [2024-11-08 11:38:09,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:09,739 INFO L225 Difference]: With dead ends: 236565 [2024-11-08 11:38:09,739 INFO L226 Difference]: Without dead ends: 138517 [2024-11-08 11:38:09,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2024-11-08 11:38:09,765 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 8551 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 7951 mSolverCounterSat, 2096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8551 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 10047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2096 IncrementalHoareTripleChecker+Valid, 7951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:09,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8551 Valid, 294 Invalid, 10047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2096 Valid, 7951 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-08 11:38:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138517 states. [2024-11-08 11:38:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138517 to 115024. [2024-11-08 11:38:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115024 states, 115023 states have (on average 1.0750632482199212) internal successors, (123657), 115023 states have internal predecessors, (123657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115024 states to 115024 states and 123657 transitions. [2024-11-08 11:38:11,295 INFO L78 Accepts]: Start accepts. Automaton has 115024 states and 123657 transitions. Word has length 433 [2024-11-08 11:38:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:11,295 INFO L471 AbstractCegarLoop]: Abstraction has 115024 states and 123657 transitions. [2024-11-08 11:38:11,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 115024 states and 123657 transitions. [2024-11-08 11:38:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2024-11-08 11:38:11,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:11,308 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:11,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 11:38:11,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:38:11,510 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash -273409696, now seen corresponding path program 1 times [2024-11-08 11:38:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040838056] [2024-11-08 11:38:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-08 11:38:11,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040838056] [2024-11-08 11:38:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040838056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:38:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:38:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:38:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783204148] [2024-11-08 11:38:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:38:11,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:38:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:38:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:11,693 INFO L87 Difference]: Start difference. First operand 115024 states and 123657 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:13,301 INFO L93 Difference]: Finished difference Result 233024 states and 250467 transitions. [2024-11-08 11:38:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:38:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 498 [2024-11-08 11:38:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:13,415 INFO L225 Difference]: With dead ends: 233024 [2024-11-08 11:38:13,415 INFO L226 Difference]: Without dead ends: 118002 [2024-11-08 11:38:13,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:13,464 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 366 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:13,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 325 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 11:38:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118002 states. [2024-11-08 11:38:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118002 to 107353. [2024-11-08 11:38:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107353 states, 107352 states have (on average 1.0743535285788808) internal successors, (115334), 107352 states have internal predecessors, (115334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:15,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107353 states to 107353 states and 115334 transitions. [2024-11-08 11:38:15,243 INFO L78 Accepts]: Start accepts. Automaton has 107353 states and 115334 transitions. Word has length 498 [2024-11-08 11:38:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 107353 states and 115334 transitions. [2024-11-08 11:38:15,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 107353 states and 115334 transitions. [2024-11-08 11:38:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-11-08 11:38:15,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:15,259 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:15,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:38:15,259 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1456772986, now seen corresponding path program 1 times [2024-11-08 11:38:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531683509] [2024-11-08 11:38:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:38:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531683509] [2024-11-08 11:38:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531683509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:38:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812889832] [2024-11-08 11:38:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:15,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:38:15,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:38:15,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 11:38:15,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 11:38:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:15,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 11:38:15,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:38:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:38:16,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:38:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-08 11:38:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812889832] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:38:17,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:38:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-08 11:38:17,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872884939] [2024-11-08 11:38:17,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:38:17,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 11:38:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 11:38:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 11:38:17,497 INFO L87 Difference]: Start difference. First operand 107353 states and 115334 transitions. Second operand has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:23,540 INFO L93 Difference]: Finished difference Result 258170 states and 276463 transitions. [2024-11-08 11:38:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 11:38:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 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 511 [2024-11-08 11:38:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:23,691 INFO L225 Difference]: With dead ends: 258170 [2024-11-08 11:38:23,691 INFO L226 Difference]: Without dead ends: 148691 [2024-11-08 11:38:23,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1022 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-08 11:38:23,737 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 2089 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 8751 mSolverCounterSat, 1462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 10213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1462 IncrementalHoareTripleChecker+Valid, 8751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:23,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 351 Invalid, 10213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1462 Valid, 8751 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-08 11:38:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148691 states. [2024-11-08 11:38:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148691 to 117561. [2024-11-08 11:38:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117561 states, 117560 states have (on average 1.0627849608710447) internal successors, (124941), 117560 states have internal predecessors, (124941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117561 states to 117561 states and 124941 transitions. [2024-11-08 11:38:25,391 INFO L78 Accepts]: Start accepts. Automaton has 117561 states and 124941 transitions. Word has length 511 [2024-11-08 11:38:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:25,392 INFO L471 AbstractCegarLoop]: Abstraction has 117561 states and 124941 transitions. [2024-11-08 11:38:25,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 117561 states and 124941 transitions. [2024-11-08 11:38:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-11-08 11:38:25,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:25,405 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:25,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 11:38:25,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 11:38:25,610 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:25,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:25,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2110531290, now seen corresponding path program 1 times [2024-11-08 11:38:25,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:25,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211084342] [2024-11-08 11:38:25,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:25,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:38:26,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:26,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211084342] [2024-11-08 11:38:26,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211084342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:38:26,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:38:26,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:38:26,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154362824] [2024-11-08 11:38:26,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:38:26,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:38:26,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:38:26,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:26,038 INFO L87 Difference]: Start difference. First operand 117561 states and 124941 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:27,793 INFO L93 Difference]: Finished difference Result 245776 states and 261179 transitions. [2024-11-08 11:38:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:38:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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 544 [2024-11-08 11:38:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:27,922 INFO L225 Difference]: With dead ends: 245776 [2024-11-08 11:38:27,922 INFO L226 Difference]: Without dead ends: 128217 [2024-11-08 11:38:27,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:27,996 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 408 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:27,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 271 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:38:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128217 states. [2024-11-08 11:38:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128217 to 126920. [2024-11-08 11:38:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126920 states, 126919 states have (on average 1.0609365028088782) internal successors, (134653), 126919 states have internal predecessors, (134653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126920 states to 126920 states and 134653 transitions. [2024-11-08 11:38:29,558 INFO L78 Accepts]: Start accepts. Automaton has 126920 states and 134653 transitions. Word has length 544 [2024-11-08 11:38:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 126920 states and 134653 transitions. [2024-11-08 11:38:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 126920 states and 134653 transitions. [2024-11-08 11:38:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2024-11-08 11:38:29,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:29,570 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:29,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 11:38:29,570 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1550554275, now seen corresponding path program 1 times [2024-11-08 11:38:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628747889] [2024-11-08 11:38:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-11-08 11:38:30,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:30,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628747889] [2024-11-08 11:38:30,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628747889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:38:30,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:38:30,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:38:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971413939] [2024-11-08 11:38:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:38:30,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:38:30,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:30,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:38:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:30,185 INFO L87 Difference]: Start difference. First operand 126920 states and 134653 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:31,914 INFO L93 Difference]: Finished difference Result 248723 states and 263778 transitions. [2024-11-08 11:38:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:38:31,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 577 [2024-11-08 11:38:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:32,057 INFO L225 Difference]: With dead ends: 248723 [2024-11-08 11:38:32,057 INFO L226 Difference]: Without dead ends: 121803 [2024-11-08 11:38:32,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:38:32,136 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 442 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:32,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 704 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 11:38:32,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2024-11-08 11:38:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 117543. [2024-11-08 11:38:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117543 states, 117542 states have (on average 1.0520664953803747) internal successors, (123662), 117542 states have internal predecessors, (123662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:33,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117543 states to 117543 states and 123662 transitions. [2024-11-08 11:38:33,720 INFO L78 Accepts]: Start accepts. Automaton has 117543 states and 123662 transitions. Word has length 577 [2024-11-08 11:38:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:38:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 117543 states and 123662 transitions. [2024-11-08 11:38:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 117543 states and 123662 transitions. [2024-11-08 11:38:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2024-11-08 11:38:33,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:38:33,730 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:38:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 11:38:33,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:38:33,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:38:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1184107234, now seen corresponding path program 1 times [2024-11-08 11:38:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:38:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721240435] [2024-11-08 11:38:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:38:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:38:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:38:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 822 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-08 11:38:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:38:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721240435] [2024-11-08 11:38:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721240435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:38:34,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:38:34,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:38:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975124846] [2024-11-08 11:38:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:38:34,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:38:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:38:34,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:38:34,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:38:34,007 INFO L87 Difference]: Start difference. First operand 117543 states and 123662 transitions. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:38:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:38:36,432 INFO L93 Difference]: Finished difference Result 258927 states and 272081 transitions. [2024-11-08 11:38:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:38:36,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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 593 [2024-11-08 11:38:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:38:36,574 INFO L225 Difference]: With dead ends: 258927 [2024-11-08 11:38:36,574 INFO L226 Difference]: Without dead ends: 141811 [2024-11-08 11:38:36,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:38:36,914 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 725 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 11:38:36,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 228 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 11:38:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141811 states.