./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label19.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_label19.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 2b69dfd7ce787b4bea7f704286d79d9dc2873c99a6634157ddcd6c7ea8551fd0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 11:38:54,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:38:54,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:38:54,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:38:54,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:38:54,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:38:54,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:38:54,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:38:54,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:38:54,669 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:38:54,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:38:54,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:38:54,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:38:54,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:38:54,672 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:38:54,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:38:54,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:38:54,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:38:54,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:38:54,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:38:54,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:38:54,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:38:54,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:38:54,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:38:54,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:38:54,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:38:54,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:38:54,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:38:54,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:38:54,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:38:54,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:38:54,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:38:54,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:38:54,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:38:54,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:38:54,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:38:54,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:38:54,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:38:54,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:38:54,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:38:54,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:38:54,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:38:54,685 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 -> 2b69dfd7ce787b4bea7f704286d79d9dc2873c99a6634157ddcd6c7ea8551fd0 [2024-11-08 11:38:54,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:38:54,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:38:54,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:38:54,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:38:54,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:38:54,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2024-11-08 11:38:56,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:38:56,779 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:38:56,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2024-11-08 11:38:56,810 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2854d2129/6174ee9a18b64425863858eeeb1d307e/FLAG3675cd74e [2024-11-08 11:38:56,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2854d2129/6174ee9a18b64425863858eeeb1d307e [2024-11-08 11:38:56,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:38:56,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:38:56,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:38:56,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:38:56,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:38:56,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:38:56" (1/1) ... [2024-11-08 11:38:56,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de641f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:56, skipping insertion in model container [2024-11-08 11:38:56,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:38:56" (1/1) ... [2024-11-08 11:38:56,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:38:57,211 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_label19.c[6359,6372] [2024-11-08 11:38:57,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:38:57,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:38:57,752 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_label19.c[6359,6372] [2024-11-08 11:38:58,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:38:58,024 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:38:58,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58 WrapperNode [2024-11-08 11:38:58,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:38:58,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:38:58,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:38:58,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:38:58,033 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:38:58" (1/1) ... [2024-11-08 11:38:58,094 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:38:58" (1/1) ... [2024-11-08 11:38:58,325 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-08 11:38:58,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:38:58,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:38:58,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:38:58,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:38:58,337 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,563 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:38:58,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:38:58,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:38:58,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:38:58,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:38:58,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (1/1) ... [2024-11-08 11:38:58,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:38:58,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:38:58,952 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:38:58,954 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:38:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:38:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:38:59,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:38:59,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:38:59,077 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:38:59,079 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:39:02,332 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-08 11:39:02,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:39:02,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:39:02,375 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:39:02,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:02 BoogieIcfgContainer [2024-11-08 11:39:02,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:39:02,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:39:02,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:39:02,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:39:02,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:38:56" (1/3) ... [2024-11-08 11:39:02,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3917f984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:02, skipping insertion in model container [2024-11-08 11:39:02,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:38:58" (2/3) ... [2024-11-08 11:39:02,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3917f984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:39:02, skipping insertion in model container [2024-11-08 11:39:02,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:39:02" (3/3) ... [2024-11-08 11:39:02,384 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label19.c [2024-11-08 11:39:02,401 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:39:02,402 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 11:39:02,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:39:02,490 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;@145448e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:39:02,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 11:39:02,498 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:39:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 11:39:02,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:02,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:39:02,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2024-11-08 11:39:02,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:02,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44766289] [2024-11-08 11:39:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:02,897 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:39:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44766289] [2024-11-08 11:39:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44766289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:02,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:02,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:39:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781572120] [2024-11-08 11:39:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:02,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:02,934 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 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:05,187 INFO L93 Difference]: Finished difference Result 1642 states and 3024 transitions. [2024-11-08 11:39:05,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-08 11:39:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:05,208 INFO L225 Difference]: With dead ends: 1642 [2024-11-08 11:39:05,209 INFO L226 Difference]: Without dead ends: 975 [2024-11-08 11:39:05,214 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:39:05,217 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 448 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:05,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 11:39:05,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-08 11:39:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2024-11-08 11:39:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 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:39:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2024-11-08 11:39:05,309 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 42 [2024-11-08 11:39:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:05,310 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2024-11-08 11:39:05,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:05,310 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2024-11-08 11:39:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 11:39:05,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:05,314 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:39:05,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:05,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash 214146598, now seen corresponding path program 1 times [2024-11-08 11:39:05,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:05,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131867499] [2024-11-08 11:39:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:39:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131867499] [2024-11-08 11:39:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131867499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:05,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:05,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960895052] [2024-11-08 11:39:05,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:05,650 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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:39:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:07,819 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2024-11-08 11:39:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-08 11:39:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:07,828 INFO L225 Difference]: With dead ends: 2814 [2024-11-08 11:39:07,828 INFO L226 Difference]: Without dead ends: 1844 [2024-11-08 11:39:07,831 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:39:07,832 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 449 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:07,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:39:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-08 11:39:07,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2024-11-08 11:39:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 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:39:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2024-11-08 11:39:07,925 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 112 [2024-11-08 11:39:07,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2024-11-08 11:39:07,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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:39:07,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2024-11-08 11:39:07,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 11:39:07,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:07,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:39:07,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash 579168329, now seen corresponding path program 1 times [2024-11-08 11:39:07,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:07,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901447379] [2024-11-08 11:39:07,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:07,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:39:08,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901447379] [2024-11-08 11:39:08,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901447379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:39:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425978573] [2024-11-08 11:39:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:08,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:08,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:08,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:08,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:08,102 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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:39:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:09,882 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2024-11-08 11:39:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:09,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-11-08 11:39:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:09,892 INFO L225 Difference]: With dead ends: 5395 [2024-11-08 11:39:09,893 INFO L226 Difference]: Without dead ends: 2701 [2024-11-08 11:39:09,896 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:39:09,898 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:09,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 11:39:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2024-11-08 11:39:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2024-11-08 11:39:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 0 states have call successors, (0), 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:39:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2024-11-08 11:39:09,958 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 134 [2024-11-08 11:39:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:09,958 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2024-11-08 11:39:09,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 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:39:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2024-11-08 11:39:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 11:39:09,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:09,963 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, 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] [2024-11-08 11:39:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:39:09,963 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:09,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -855731843, now seen corresponding path program 1 times [2024-11-08 11:39:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060956779] [2024-11-08 11:39:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:39:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060956779] [2024-11-08 11:39:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060956779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:10,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:10,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:10,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831196899] [2024-11-08 11:39:10,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:10,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:10,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:10,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:10,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:10,304 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:11,798 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2024-11-08 11:39:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:11,814 INFO L225 Difference]: With dead ends: 7108 [2024-11-08 11:39:11,814 INFO L226 Difference]: Without dead ends: 4409 [2024-11-08 11:39:11,821 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:39:11,822 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:11,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:39:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-11-08 11:39:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2024-11-08 11:39:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 0 states have call successors, (0), 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:39:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2024-11-08 11:39:11,922 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 194 [2024-11-08 11:39:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:11,922 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2024-11-08 11:39:11,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:11,923 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2024-11-08 11:39:11,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 11:39:11,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:11,925 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, 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] [2024-11-08 11:39:11,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:39:11,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:11,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:11,926 INFO L85 PathProgramCache]: Analyzing trace with hash 995947064, now seen corresponding path program 1 times [2024-11-08 11:39:11,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:11,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886936730] [2024-11-08 11:39:11,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:11,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 11:39:12,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:12,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886936730] [2024-11-08 11:39:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886936730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:12,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166015626] [2024-11-08 11:39:12,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:12,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:12,130 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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:39:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:13,576 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2024-11-08 11:39:13,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 196 [2024-11-08 11:39:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:13,597 INFO L225 Difference]: With dead ends: 10936 [2024-11-08 11:39:13,597 INFO L226 Difference]: Without dead ends: 6528 [2024-11-08 11:39:13,603 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:39:13,605 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 409 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:13,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:39:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2024-11-08 11:39:13,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2024-11-08 11:39:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 0 states have call successors, (0), 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:39:13,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2024-11-08 11:39:13,688 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 196 [2024-11-08 11:39:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:13,689 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2024-11-08 11:39:13,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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:39:13,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2024-11-08 11:39:13,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-08 11:39:13,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:13,693 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:39:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:39:13,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:13,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1902352254, now seen corresponding path program 1 times [2024-11-08 11:39:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285967783] [2024-11-08 11:39:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:39:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285967783] [2024-11-08 11:39:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285967783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586024489] [2024-11-08 11:39:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:14,008 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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:39:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:15,514 INFO L93 Difference]: Finished difference Result 10045 states and 11706 transitions. [2024-11-08 11:39:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:15,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 262 [2024-11-08 11:39:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:15,531 INFO L225 Difference]: With dead ends: 10045 [2024-11-08 11:39:15,532 INFO L226 Difference]: Without dead ends: 5665 [2024-11-08 11:39:15,538 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:39:15,540 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 394 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:15,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 894 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:39:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2024-11-08 11:39:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5234. [2024-11-08 11:39:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 5233 states have (on average 1.1587999235620103) internal successors, (6064), 5233 states have internal predecessors, (6064), 0 states have call successors, (0), 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:39:15,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 6064 transitions. [2024-11-08 11:39:15,626 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 6064 transitions. Word has length 262 [2024-11-08 11:39:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:15,628 INFO L471 AbstractCegarLoop]: Abstraction has 5234 states and 6064 transitions. [2024-11-08 11:39:15,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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:39:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 6064 transitions. [2024-11-08 11:39:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-11-08 11:39:15,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:15,633 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:39:15,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:39:15,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:15,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:15,634 INFO L85 PathProgramCache]: Analyzing trace with hash -773816133, now seen corresponding path program 1 times [2024-11-08 11:39:15,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:15,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782616235] [2024-11-08 11:39:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:15,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-08 11:39:15,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:15,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782616235] [2024-11-08 11:39:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782616235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:15,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:15,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:15,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284477282] [2024-11-08 11:39:15,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:15,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:15,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:15,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:15,868 INFO L87 Difference]: Start difference. First operand 5234 states and 6064 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:17,480 INFO L93 Difference]: Finished difference Result 12593 states and 14783 transitions. [2024-11-08 11:39:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 274 [2024-11-08 11:39:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:17,504 INFO L225 Difference]: With dead ends: 12593 [2024-11-08 11:39:17,505 INFO L226 Difference]: Without dead ends: 6936 [2024-11-08 11:39:17,512 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:39:17,513 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:17,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 847 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:39:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2024-11-08 11:39:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6936. [2024-11-08 11:39:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6936 states, 6935 states have (on average 1.1322278298485942) internal successors, (7852), 6935 states have internal predecessors, (7852), 0 states have call successors, (0), 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:39:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6936 states to 6936 states and 7852 transitions. [2024-11-08 11:39:17,623 INFO L78 Accepts]: Start accepts. Automaton has 6936 states and 7852 transitions. Word has length 274 [2024-11-08 11:39:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:17,623 INFO L471 AbstractCegarLoop]: Abstraction has 6936 states and 7852 transitions. [2024-11-08 11:39:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 6936 states and 7852 transitions. [2024-11-08 11:39:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-08 11:39:17,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:17,633 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:39:17,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:39:17,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:17,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:17,634 INFO L85 PathProgramCache]: Analyzing trace with hash -944523490, now seen corresponding path program 1 times [2024-11-08 11:39:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469949182] [2024-11-08 11:39:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-08 11:39:17,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469949182] [2024-11-08 11:39:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469949182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:17,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524897522] [2024-11-08 11:39:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:17,917 INFO L87 Difference]: Start difference. First operand 6936 states and 7852 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:19,619 INFO L93 Difference]: Finished difference Result 16424 states and 18762 transitions. [2024-11-08 11:39:19,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:19,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 314 [2024-11-08 11:39:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:19,637 INFO L225 Difference]: With dead ends: 16424 [2024-11-08 11:39:19,637 INFO L226 Difference]: Without dead ends: 9490 [2024-11-08 11:39:19,646 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:39:19,646 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 463 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:19,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 330 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:39:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9490 states. [2024-11-08 11:39:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9490 to 8636. [2024-11-08 11:39:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8636 states, 8635 states have (on average 1.1345686160972785) internal successors, (9797), 8635 states have internal predecessors, (9797), 0 states have call successors, (0), 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:39:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8636 states to 8636 states and 9797 transitions. [2024-11-08 11:39:19,754 INFO L78 Accepts]: Start accepts. Automaton has 8636 states and 9797 transitions. Word has length 314 [2024-11-08 11:39:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 8636 states and 9797 transitions. [2024-11-08 11:39:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 8636 states and 9797 transitions. [2024-11-08 11:39:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-08 11:39:19,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:19,760 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:39:19,761 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:19,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 678396003, now seen corresponding path program 1 times [2024-11-08 11:39:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:19,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90057298] [2024-11-08 11:39:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:39:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90057298] [2024-11-08 11:39:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90057298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711662646] [2024-11-08 11:39:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:20,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:20,108 INFO L87 Difference]: Start difference. First operand 8636 states and 9797 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:21,752 INFO L93 Difference]: Finished difference Result 23689 states and 26990 transitions. [2024-11-08 11:39:21,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:21,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 331 [2024-11-08 11:39:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:21,782 INFO L225 Difference]: With dead ends: 23689 [2024-11-08 11:39:21,783 INFO L226 Difference]: Without dead ends: 15055 [2024-11-08 11:39:21,795 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:39:21,795 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 459 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:21,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 807 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:39:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15055 states. [2024-11-08 11:39:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15055 to 14182. [2024-11-08 11:39:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14182 states, 14181 states have (on average 1.130315210492913) internal successors, (16029), 14181 states have internal predecessors, (16029), 0 states have call successors, (0), 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:39:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14182 states to 14182 states and 16029 transitions. [2024-11-08 11:39:21,998 INFO L78 Accepts]: Start accepts. Automaton has 14182 states and 16029 transitions. Word has length 331 [2024-11-08 11:39:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:21,999 INFO L471 AbstractCegarLoop]: Abstraction has 14182 states and 16029 transitions. [2024-11-08 11:39:21,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 11:39:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14182 states and 16029 transitions. [2024-11-08 11:39:22,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-08 11:39:22,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:22,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 11:39:22,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:22,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1326543376, now seen corresponding path program 1 times [2024-11-08 11:39:22,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845264437] [2024-11-08 11:39:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 11:39:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845264437] [2024-11-08 11:39:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845264437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799034458] [2024-11-08 11:39:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:39:22,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:22,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:39:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:39:22,471 INFO L87 Difference]: Start difference. First operand 14182 states and 16029 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:39:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:24,653 INFO L93 Difference]: Finished difference Result 34771 states and 39275 transitions. [2024-11-08 11:39:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:39:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:39:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:24,688 INFO L225 Difference]: With dead ends: 34771 [2024-11-08 11:39:24,688 INFO L226 Difference]: Without dead ends: 20166 [2024-11-08 11:39:24,707 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:39:24,708 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 628 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:24,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 244 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-08 11:39:24,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20166 states. [2024-11-08 11:39:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20166 to 20164. [2024-11-08 11:39:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20164 states, 20163 states have (on average 1.1312304716560035) internal successors, (22809), 20163 states have internal predecessors, (22809), 0 states have call successors, (0), 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:39:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 22809 transitions. [2024-11-08 11:39:25,050 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 22809 transitions. Word has length 381 [2024-11-08 11:39:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 20164 states and 22809 transitions. [2024-11-08 11:39:25,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:39:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 22809 transitions. [2024-11-08 11:39:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-08 11:39:25,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:25,154 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 11:39:25,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash -467665579, now seen corresponding path program 1 times [2024-11-08 11:39:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867707690] [2024-11-08 11:39:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-08 11:39:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:25,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867707690] [2024-11-08 11:39:25,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867707690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:25,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449468011] [2024-11-08 11:39:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:25,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:25,556 INFO L87 Difference]: Start difference. First operand 20164 states and 22809 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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:39:27,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:27,188 INFO L93 Difference]: Finished difference Result 45882 states and 51904 transitions. [2024-11-08 11:39:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 402 [2024-11-08 11:39:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:27,215 INFO L225 Difference]: With dead ends: 45882 [2024-11-08 11:39:27,215 INFO L226 Difference]: Without dead ends: 25720 [2024-11-08 11:39:27,230 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:39:27,230 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 416 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:27,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 765 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:39:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25720 states. [2024-11-08 11:39:27,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25720 to 20153. [2024-11-08 11:39:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20153 states, 20152 states have (on average 1.1310539896784437) internal successors, (22793), 20152 states have internal predecessors, (22793), 0 states have call successors, (0), 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:39:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20153 states to 20153 states and 22793 transitions. [2024-11-08 11:39:27,466 INFO L78 Accepts]: Start accepts. Automaton has 20153 states and 22793 transitions. Word has length 402 [2024-11-08 11:39:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 20153 states and 22793 transitions. [2024-11-08 11:39:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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:39:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 20153 states and 22793 transitions. [2024-11-08 11:39:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2024-11-08 11:39:27,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:27,480 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:27,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 11:39:27,481 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:27,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1684945626, now seen corresponding path program 1 times [2024-11-08 11:39:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:27,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724744597] [2024-11-08 11:39:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-08 11:39:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724744597] [2024-11-08 11:39:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724744597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996814699] [2024-11-08 11:39:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:27,805 INFO L87 Difference]: Start difference. First operand 20153 states and 22793 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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:39:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:29,290 INFO L93 Difference]: Finished difference Result 48404 states and 54963 transitions. [2024-11-08 11:39:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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:39:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:29,323 INFO L225 Difference]: With dead ends: 48404 [2024-11-08 11:39:29,323 INFO L226 Difference]: Without dead ends: 28253 [2024-11-08 11:39:29,339 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:39:29,340 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 506 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:29,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 252 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:39:29,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28253 states. [2024-11-08 11:39:29,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28253 to 28236. [2024-11-08 11:39:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28236 states, 28235 states have (on average 1.1271117407472995) internal successors, (31824), 28235 states have internal predecessors, (31824), 0 states have call successors, (0), 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:39:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28236 states to 28236 states and 31824 transitions. [2024-11-08 11:39:29,773 INFO L78 Accepts]: Start accepts. Automaton has 28236 states and 31824 transitions. Word has length 403 [2024-11-08 11:39:29,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:29,774 INFO L471 AbstractCegarLoop]: Abstraction has 28236 states and 31824 transitions. [2024-11-08 11:39:29,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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:39:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28236 states and 31824 transitions. [2024-11-08 11:39:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-11-08 11:39:29,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:29,786 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:29,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 11:39:29,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:29,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:29,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1441159319, now seen corresponding path program 1 times [2024-11-08 11:39:29,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839752052] [2024-11-08 11:39:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 224 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839752052] [2024-11-08 11:39:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839752052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:39:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441791894] [2024-11-08 11:39:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:30,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:39:30,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:39:30,337 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:39:30,339 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:39:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:30,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 11:39:30,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:39:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 224 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:31,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:39:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441791894] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 11:39:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 11:39:31,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2024-11-08 11:39:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009014539] [2024-11-08 11:39:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:31,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:39:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:39:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 11:39:31,537 INFO L87 Difference]: Start difference. First operand 28236 states and 31824 transitions. Second operand has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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:39:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:34,487 INFO L93 Difference]: Finished difference Result 78207 states and 87757 transitions. [2024-11-08 11:39:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:39:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 410 [2024-11-08 11:39:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:34,533 INFO L225 Difference]: With dead ends: 78207 [2024-11-08 11:39:34,533 INFO L226 Difference]: Without dead ends: 48267 [2024-11-08 11:39:34,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 817 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:39:34,547 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 763 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:34,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 193 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-08 11:39:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48267 states. [2024-11-08 11:39:34,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48267 to 44010. [2024-11-08 11:39:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44010 states, 44009 states have (on average 1.1212933718103115) internal successors, (49347), 44009 states have internal predecessors, (49347), 0 states have call successors, (0), 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:39:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44010 states to 44010 states and 49347 transitions. [2024-11-08 11:39:35,066 INFO L78 Accepts]: Start accepts. Automaton has 44010 states and 49347 transitions. Word has length 410 [2024-11-08 11:39:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:35,067 INFO L471 AbstractCegarLoop]: Abstraction has 44010 states and 49347 transitions. [2024-11-08 11:39:35,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.75) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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:39:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 44010 states and 49347 transitions. [2024-11-08 11:39:35,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-11-08 11:39:35,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:35,076 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-08 11:39:35,095 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:39:35,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 11:39:35,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:35,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 927922568, now seen corresponding path program 1 times [2024-11-08 11:39:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:35,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179296446] [2024-11-08 11:39:35,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:35,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-08 11:39:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179296446] [2024-11-08 11:39:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179296446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897708520] [2024-11-08 11:39:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:35,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:35,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:35,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:35,643 INFO L87 Difference]: Start difference. First operand 44010 states and 49347 transitions. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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:39:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:37,439 INFO L93 Difference]: Finished difference Result 102049 states and 114541 transitions. [2024-11-08 11:39:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 446 [2024-11-08 11:39:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:37,502 INFO L225 Difference]: With dead ends: 102049 [2024-11-08 11:39:37,502 INFO L226 Difference]: Without dead ends: 54627 [2024-11-08 11:39:37,536 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:39:37,536 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 500 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:37,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 734 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 11:39:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54627 states. [2024-11-08 11:39:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54627 to 52071. [2024-11-08 11:39:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52071 states, 52070 states have (on average 1.1085845976570001) internal successors, (57724), 52070 states have internal predecessors, (57724), 0 states have call successors, (0), 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:39:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52071 states to 52071 states and 57724 transitions. [2024-11-08 11:39:38,316 INFO L78 Accepts]: Start accepts. Automaton has 52071 states and 57724 transitions. Word has length 446 [2024-11-08 11:39:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 52071 states and 57724 transitions. [2024-11-08 11:39:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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:39:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 52071 states and 57724 transitions. [2024-11-08 11:39:38,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-11-08 11:39:38,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:38,329 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:39:38,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 11:39:38,329 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:38,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 613060915, now seen corresponding path program 1 times [2024-11-08 11:39:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449853855] [2024-11-08 11:39:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:38,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449853855] [2024-11-08 11:39:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449853855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:39,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:39,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 11:39:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052572597] [2024-11-08 11:39:39,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:39:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:39:39,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:39:39,167 INFO L87 Difference]: Start difference. First operand 52071 states and 57724 transitions. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 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:39:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:41,792 INFO L93 Difference]: Finished difference Result 133967 states and 148181 transitions. [2024-11-08 11:39:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:39:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 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 448 [2024-11-08 11:39:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:42,045 INFO L225 Difference]: With dead ends: 133967 [2024-11-08 11:39:42,045 INFO L226 Difference]: Without dead ends: 81898 [2024-11-08 11:39:42,074 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:39:42,075 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 774 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:42,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 171 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 11:39:42,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81898 states. [2024-11-08 11:39:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81898 to 77638. [2024-11-08 11:39:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77638 states, 77637 states have (on average 1.1012403879593493) internal successors, (85497), 77637 states have internal predecessors, (85497), 0 states have call successors, (0), 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:39:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77638 states to 77638 states and 85497 transitions. [2024-11-08 11:39:43,054 INFO L78 Accepts]: Start accepts. Automaton has 77638 states and 85497 transitions. Word has length 448 [2024-11-08 11:39:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:43,055 INFO L471 AbstractCegarLoop]: Abstraction has 77638 states and 85497 transitions. [2024-11-08 11:39:43,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 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:39:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77638 states and 85497 transitions. [2024-11-08 11:39:43,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2024-11-08 11:39:43,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:43,076 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:39:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 11:39:43,076 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:43,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash -717338311, now seen corresponding path program 1 times [2024-11-08 11:39:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604387755] [2024-11-08 11:39:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:43,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-11-08 11:39:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604387755] [2024-11-08 11:39:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604387755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:43,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309811420] [2024-11-08 11:39:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:43,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:43,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:43,666 INFO L87 Difference]: Start difference. First operand 77638 states and 85497 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:45,432 INFO L93 Difference]: Finished difference Result 168473 states and 185597 transitions. [2024-11-08 11:39:45,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 491 [2024-11-08 11:39:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:45,526 INFO L225 Difference]: With dead ends: 168473 [2024-11-08 11:39:45,526 INFO L226 Difference]: Without dead ends: 90837 [2024-11-08 11:39:45,582 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:39:45,583 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 452 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:45,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 372 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 11:39:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90837 states. [2024-11-08 11:39:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90837 to 85293. [2024-11-08 11:39:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85293 states, 85292 states have (on average 1.0996693711016274) internal successors, (93793), 85292 states have internal predecessors, (93793), 0 states have call successors, (0), 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:39:46,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85293 states to 85293 states and 93793 transitions. [2024-11-08 11:39:46,893 INFO L78 Accepts]: Start accepts. Automaton has 85293 states and 93793 transitions. Word has length 491 [2024-11-08 11:39:46,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:46,894 INFO L471 AbstractCegarLoop]: Abstraction has 85293 states and 93793 transitions. [2024-11-08 11:39:46,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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:39:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 85293 states and 93793 transitions. [2024-11-08 11:39:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-08 11:39:46,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:46,906 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:39:46,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 11:39:46,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:46,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:46,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1143968982, now seen corresponding path program 1 times [2024-11-08 11:39:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651455979] [2024-11-08 11:39:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 11:39:47,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:47,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651455979] [2024-11-08 11:39:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651455979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:39:47,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:39:47,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:39:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360921784] [2024-11-08 11:39:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:39:47,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:39:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:47,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:39:47,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:39:47,581 INFO L87 Difference]: Start difference. First operand 85293 states and 93793 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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:39:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:39:49,454 INFO L93 Difference]: Finished difference Result 179531 states and 197119 transitions. [2024-11-08 11:39:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:39:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 504 [2024-11-08 11:39:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:39:49,564 INFO L225 Difference]: With dead ends: 179531 [2024-11-08 11:39:49,564 INFO L226 Difference]: Without dead ends: 94240 [2024-11-08 11:39:49,593 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:39:49,594 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 455 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 11:39:49,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 371 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 11:39:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94240 states. [2024-11-08 11:39:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94240 to 84018. [2024-11-08 11:39:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84018 states, 84017 states have (on average 1.1001344965899758) internal successors, (92430), 84017 states have internal predecessors, (92430), 0 states have call successors, (0), 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:39:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84018 states to 84018 states and 92430 transitions. [2024-11-08 11:39:50,671 INFO L78 Accepts]: Start accepts. Automaton has 84018 states and 92430 transitions. Word has length 504 [2024-11-08 11:39:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:39:50,671 INFO L471 AbstractCegarLoop]: Abstraction has 84018 states and 92430 transitions. [2024-11-08 11:39:50,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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:39:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand 84018 states and 92430 transitions. [2024-11-08 11:39:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2024-11-08 11:39:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:39:50,683 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:50,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 11:39:50,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:39:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:39:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1761866527, now seen corresponding path program 1 times [2024-11-08 11:39:50,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:39:50,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601274597] [2024-11-08 11:39:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:39:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:39:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601274597] [2024-11-08 11:39:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601274597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:39:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938589331] [2024-11-08 11:39:52,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:39:52,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:39:52,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:39:52,368 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:39:52,370 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:39:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:39:52,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 11:39:52,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:39:53,083 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:53,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 11:39:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 266 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:39:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938589331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 11:39:54,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 11:39:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-08 11:39:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999189364] [2024-11-08 11:39:54,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 11:39:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 11:39:54,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:39:54,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 11:39:54,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-08 11:39:54,186 INFO L87 Difference]: Start difference. First operand 84018 states and 92430 transitions. Second operand has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 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:40:01,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:01,892 INFO L93 Difference]: Finished difference Result 214491 states and 235142 transitions. [2024-11-08 11:40:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 11:40:01,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 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 533 [2024-11-08 11:40:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:02,056 INFO L225 Difference]: With dead ends: 214491 [2024-11-08 11:40:02,056 INFO L226 Difference]: Without dead ends: 128775 [2024-11-08 11:40:02,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 1061 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-08 11:40:02,076 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 7916 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 8953 mSolverCounterSat, 1147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7916 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 10100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1147 IncrementalHoareTripleChecker+Valid, 8953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:02,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7916 Valid, 486 Invalid, 10100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1147 Valid, 8953 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-08 11:40:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128775 states. [2024-11-08 11:40:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128775 to 124484. [2024-11-08 11:40:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124484 states, 124483 states have (on average 1.0850316910742832) internal successors, (135068), 124483 states have internal predecessors, (135068), 0 states have call successors, (0), 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:40:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124484 states to 124484 states and 135068 transitions. [2024-11-08 11:40:03,902 INFO L78 Accepts]: Start accepts. Automaton has 124484 states and 135068 transitions. Word has length 533 [2024-11-08 11:40:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:40:03,902 INFO L471 AbstractCegarLoop]: Abstraction has 124484 states and 135068 transitions. [2024-11-08 11:40:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 87.2) internal successors, (872), 9 states have internal predecessors, (872), 0 states have call successors, (0), 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:40:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 124484 states and 135068 transitions. [2024-11-08 11:40:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2024-11-08 11:40:03,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:40:03,913 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 11:40:03,926 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:40:04,113 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,SelfDestructingSolverStorable17 [2024-11-08 11:40:04,114 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:40:04,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:40:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -673527079, now seen corresponding path program 1 times [2024-11-08 11:40:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:40:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686877638] [2024-11-08 11:40:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:40:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 309 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 11:40:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:40:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686877638] [2024-11-08 11:40:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686877638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 11:40:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387918900] [2024-11-08 11:40:05,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:40:05,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 11:40:05,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:40:05,359 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:40:05,361 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:40:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:40:05,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 11:40:05,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 11:40:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 11:40:05,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 11:40:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387918900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:40:05,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 11:40:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-08 11:40:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84958973] [2024-11-08 11:40:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:40:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:40:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:40:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:40:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:40:05,842 INFO L87 Difference]: Start difference. First operand 124484 states and 135068 transitions. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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:40:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:40:08,481 INFO L93 Difference]: Finished difference Result 280991 states and 305359 transitions. [2024-11-08 11:40:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:40:08,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 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 576 [2024-11-08 11:40:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:40:08,660 INFO L225 Difference]: With dead ends: 280991 [2024-11-08 11:40:08,660 INFO L226 Difference]: Without dead ends: 156507 [2024-11-08 11:40:08,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 11:40:08,690 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 483 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 11:40:08,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 240 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 11:40:08,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156507 states.