./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.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 a8ce96d555e872b609ed7174eef821f9a0406316106ba92ad582ec48aa272726 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:55:13,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:55:13,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:55:13,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:55:13,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:55:13,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:55:13,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:55:13,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:55:13,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:55:13,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:55:13,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:55:13,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:55:13,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:55:13,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:55:13,549 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:55:13,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:55:13,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:55:13,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:55:13,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:55:13,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:55:13,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:55:13,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:55:13,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:55:13,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:55:13,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:55:13,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:55:13,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:55:13,554 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:55:13,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:55:13,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:55:13,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:55:13,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:55:13,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:55:13,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:55:13,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:55:13,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:55:13,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:55:13,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:55:13,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:55:13,558 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:55:13,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:55:13,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:55:13,562 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 -> a8ce96d555e872b609ed7174eef821f9a0406316106ba92ad582ec48aa272726 [2024-10-13 23:55:13,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:55:13,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:55:13,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:55:13,825 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:55:13,825 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:55:13,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c [2024-10-13 23:55:15,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:55:15,708 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:55:15,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c [2024-10-13 23:55:15,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1981230e/5a6be453b36847389aa1da55f7ba7950/FLAG2ca1f9ad0 [2024-10-13 23:55:15,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1981230e/5a6be453b36847389aa1da55f7ba7950 [2024-10-13 23:55:15,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:55:15,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:55:15,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:55:15,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:55:15,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:55:15,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:55:15" (1/1) ... [2024-10-13 23:55:15,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797ce28c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:15, skipping insertion in model container [2024-10-13 23:55:15,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:55:15" (1/1) ... [2024-10-13 23:55:15,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:55:16,080 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c[5490,5503] [2024-10-13 23:55:16,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:55:16,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:55:16,633 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c[5490,5503] [2024-10-13 23:55:16,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:55:16,912 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:55:16,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16 WrapperNode [2024-10-13 23:55:16,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:55:16,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:55:16,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:55:16,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:55:16,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:16,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,170 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-10-13 23:55:17,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:55:17,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:55:17,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:55:17,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:55:17,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,410 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:55:17,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,535 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,657 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:55:17,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:55:17,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:55:17,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:55:17,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (1/1) ... [2024-10-13 23:55:17,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:55:17,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:55:17,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:55:17,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:55:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:55:17,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:55:17,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:55:17,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:55:17,815 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:55:17,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:55:20,948 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-10-13 23:55:20,948 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:55:20,994 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:55:20,994 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:55:20,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:55:20 BoogieIcfgContainer [2024-10-13 23:55:20,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:55:20,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:55:20,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:55:21,000 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:55:21,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:55:15" (1/3) ... [2024-10-13 23:55:21,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791fb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:55:21, skipping insertion in model container [2024-10-13 23:55:21,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:55:16" (2/3) ... [2024-10-13 23:55:21,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6791fb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:55:21, skipping insertion in model container [2024-10-13 23:55:21,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:55:20" (3/3) ... [2024-10-13 23:55:21,003 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label15.c [2024-10-13 23:55:21,025 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:55:21,025 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:55:21,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:55:21,112 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;@7af09ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:55:21,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:55:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 23:55:21,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:21,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:21,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:21,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2104242004, now seen corresponding path program 1 times [2024-10-13 23:55:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493905526] [2024-10-13 23:55:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:21,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:21,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493905526] [2024-10-13 23:55:21,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493905526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:21,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:21,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:55:21,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756847699] [2024-10-13 23:55:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:21,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:55:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:21,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:55:21,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:55:21,368 INFO L87 Difference]: Start difference. First operand has 528 states, 526 states have (on average 1.9011406844106464) internal successors, (1000), 527 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:21,442 INFO L93 Difference]: Finished difference Result 1055 states and 1999 transitions. [2024-10-13 23:55:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:55:21,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-13 23:55:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:21,468 INFO L225 Difference]: With dead ends: 1055 [2024-10-13 23:55:21,468 INFO L226 Difference]: Without dead ends: 526 [2024-10-13 23:55:21,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:55:21,480 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:21,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 935 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:55:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-13 23:55:21,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2024-10-13 23:55:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2024-10-13 23:55:21,556 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 35 [2024-10-13 23:55:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:21,556 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2024-10-13 23:55:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2024-10-13 23:55:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 23:55:21,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:21,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:55:21,558 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1200946327, now seen corresponding path program 1 times [2024-10-13 23:55:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:21,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182944146] [2024-10-13 23:55:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:21,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182944146] [2024-10-13 23:55:21,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182944146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:55:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461241529] [2024-10-13 23:55:21,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:21,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:21,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:21,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:21,817 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:24,143 INFO L93 Difference]: Finished difference Result 1535 states and 2741 transitions. [2024-10-13 23:55:24,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-13 23:55:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:24,148 INFO L225 Difference]: With dead ends: 1535 [2024-10-13 23:55:24,148 INFO L226 Difference]: Without dead ends: 1010 [2024-10-13 23:55:24,150 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-10-13 23:55:24,151 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 497 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:24,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 197 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:55:24,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-10-13 23:55:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 995. [2024-10-13 23:55:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 994 states have (on average 1.7364185110663983) internal successors, (1726), 994 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1726 transitions. [2024-10-13 23:55:24,197 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1726 transitions. Word has length 35 [2024-10-13 23:55:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:24,198 INFO L471 AbstractCegarLoop]: Abstraction has 995 states and 1726 transitions. [2024-10-13 23:55:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1726 transitions. [2024-10-13 23:55:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 23:55:24,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:24,203 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:55:24,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:24,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:24,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2063531368, now seen corresponding path program 1 times [2024-10-13 23:55:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535971205] [2024-10-13 23:55:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:24,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535971205] [2024-10-13 23:55:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535971205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:24,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:24,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:55:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003432080] [2024-10-13 23:55:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:24,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:24,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:24,466 INFO L87 Difference]: Start difference. First operand 995 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:26,681 INFO L93 Difference]: Finished difference Result 2870 states and 5024 transitions. [2024-10-13 23:55:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:26,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-13 23:55:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:26,689 INFO L225 Difference]: With dead ends: 2870 [2024-10-13 23:55:26,689 INFO L226 Difference]: Without dead ends: 1876 [2024-10-13 23:55:26,693 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-10-13 23:55:26,694 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:26,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 518 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 23:55:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2024-10-13 23:55:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1869. [2024-10-13 23:55:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 1.4721627408993576) internal successors, (2750), 1868 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2750 transitions. [2024-10-13 23:55:26,737 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2750 transitions. Word has length 100 [2024-10-13 23:55:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:26,739 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2750 transitions. [2024-10-13 23:55:26,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2750 transitions. [2024-10-13 23:55:26,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 23:55:26,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:26,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:26,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:55:26,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:26,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 357601429, now seen corresponding path program 1 times [2024-10-13 23:55:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443498000] [2024-10-13 23:55:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443498000] [2024-10-13 23:55:27,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443498000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:27,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:27,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068596716] [2024-10-13 23:55:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:55:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:55:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:55:27,168 INFO L87 Difference]: Start difference. First operand 1869 states and 2750 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:30,775 INFO L93 Difference]: Finished difference Result 6369 states and 9653 transitions. [2024-10-13 23:55:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:55:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-13 23:55:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:30,791 INFO L225 Difference]: With dead ends: 6369 [2024-10-13 23:55:30,791 INFO L226 Difference]: Without dead ends: 4501 [2024-10-13 23:55:30,794 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-10-13 23:55:30,795 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1017 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2672 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 3486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 2672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:30,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 203 Invalid, 3486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 2672 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 23:55:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2024-10-13 23:55:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4496. [2024-10-13 23:55:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.4271412680756397) internal successors, (6415), 4495 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6415 transitions. [2024-10-13 23:55:30,874 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6415 transitions. Word has length 105 [2024-10-13 23:55:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:30,876 INFO L471 AbstractCegarLoop]: Abstraction has 4496 states and 6415 transitions. [2024-10-13 23:55:30,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6415 transitions. [2024-10-13 23:55:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 23:55:30,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:30,884 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:30,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:55:30,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:30,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1383530739, now seen corresponding path program 1 times [2024-10-13 23:55:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:30,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411412261] [2024-10-13 23:55:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411412261] [2024-10-13 23:55:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411412261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:55:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445364501] [2024-10-13 23:55:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:31,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:31,111 INFO L87 Difference]: Start difference. First operand 4496 states and 6415 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:32,929 INFO L93 Difference]: Finished difference Result 11973 states and 17430 transitions. [2024-10-13 23:55:32,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:32,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-10-13 23:55:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:32,956 INFO L225 Difference]: With dead ends: 11973 [2024-10-13 23:55:32,956 INFO L226 Difference]: Without dead ends: 7478 [2024-10-13 23:55:32,964 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-10-13 23:55:32,965 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 364 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:32,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 495 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:55:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7478 states. [2024-10-13 23:55:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7478 to 7045. [2024-10-13 23:55:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7045 states, 7044 states have (on average 1.3350369108461102) internal successors, (9404), 7044 states have internal predecessors, (9404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 9404 transitions. [2024-10-13 23:55:33,103 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 9404 transitions. Word has length 141 [2024-10-13 23:55:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 7045 states and 9404 transitions. [2024-10-13 23:55:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 9404 transitions. [2024-10-13 23:55:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 23:55:33,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:33,107 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:55:33,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:55:33,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:33,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash -622822676, now seen corresponding path program 1 times [2024-10-13 23:55:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774572408] [2024-10-13 23:55:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 63 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 23:55:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:33,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774572408] [2024-10-13 23:55:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774572408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:55:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352699650] [2024-10-13 23:55:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:33,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:55:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:55:33,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:55:33,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:55:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:33,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:55:33,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:55:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-13 23:55:33,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:55:33,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352699650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:33,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:55:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:55:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243713179] [2024-10-13 23:55:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:33,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:33,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:33,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:55:33,823 INFO L87 Difference]: Start difference. First operand 7045 states and 9404 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:35,593 INFO L93 Difference]: Finished difference Result 18765 states and 25513 transitions. [2024-10-13 23:55:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 170 [2024-10-13 23:55:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:35,631 INFO L225 Difference]: With dead ends: 18765 [2024-10-13 23:55:35,631 INFO L226 Difference]: Without dead ends: 12146 [2024-10-13 23:55:35,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:55:35,644 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 571 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:35,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 715 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:55:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12146 states. [2024-10-13 23:55:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12146 to 11295. [2024-10-13 23:55:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11295 states, 11294 states have (on average 1.3668319461661058) internal successors, (15437), 11294 states have internal predecessors, (15437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11295 states to 11295 states and 15437 transitions. [2024-10-13 23:55:35,886 INFO L78 Accepts]: Start accepts. Automaton has 11295 states and 15437 transitions. Word has length 170 [2024-10-13 23:55:35,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:35,888 INFO L471 AbstractCegarLoop]: Abstraction has 11295 states and 15437 transitions. [2024-10-13 23:55:35,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand 11295 states and 15437 transitions. [2024-10-13 23:55:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 23:55:35,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:35,891 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:55:35,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:55:36,092 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,SelfDestructingSolverStorable5 [2024-10-13 23:55:36,092 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:36,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2068436520, now seen corresponding path program 1 times [2024-10-13 23:55:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:36,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563580267] [2024-10-13 23:55:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:36,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-13 23:55:36,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:36,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563580267] [2024-10-13 23:55:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563580267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:36,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:36,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:55:36,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264131607] [2024-10-13 23:55:36,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:36,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:36,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:36,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:36,281 INFO L87 Difference]: Start difference. First operand 11295 states and 15437 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:38,077 INFO L93 Difference]: Finished difference Result 23014 states and 31466 transitions. [2024-10-13 23:55:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:38,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 178 [2024-10-13 23:55:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:38,097 INFO L225 Difference]: With dead ends: 23014 [2024-10-13 23:55:38,098 INFO L226 Difference]: Without dead ends: 11291 [2024-10-13 23:55:38,112 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-10-13 23:55:38,113 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 381 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:38,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 581 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:55:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11291 states. [2024-10-13 23:55:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11291 to 8314. [2024-10-13 23:55:38,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8314 states, 8313 states have (on average 1.2512931552989295) internal successors, (10402), 8313 states have internal predecessors, (10402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8314 states to 8314 states and 10402 transitions. [2024-10-13 23:55:38,360 INFO L78 Accepts]: Start accepts. Automaton has 8314 states and 10402 transitions. Word has length 178 [2024-10-13 23:55:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:38,360 INFO L471 AbstractCegarLoop]: Abstraction has 8314 states and 10402 transitions. [2024-10-13 23:55:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8314 states and 10402 transitions. [2024-10-13 23:55:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 23:55:38,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:38,364 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:38,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:55:38,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash 688634754, now seen corresponding path program 1 times [2024-10-13 23:55:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835570493] [2024-10-13 23:55:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:55:38,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:38,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835570493] [2024-10-13 23:55:38,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835570493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:38,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939997984] [2024-10-13 23:55:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:38,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:38,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:38,630 INFO L87 Difference]: Start difference. First operand 8314 states and 10402 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:40,224 INFO L93 Difference]: Finished difference Result 21300 states and 27163 transitions. [2024-10-13 23:55:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2024-10-13 23:55:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:40,252 INFO L225 Difference]: With dead ends: 21300 [2024-10-13 23:55:40,252 INFO L226 Difference]: Without dead ends: 12987 [2024-10-13 23:55:40,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:40,265 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 491 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:40,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 799 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:55:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12987 states. [2024-10-13 23:55:40,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12987 to 12987. [2024-10-13 23:55:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12987 states, 12986 states have (on average 1.2240104728168797) internal successors, (15895), 12986 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12987 states to 12987 states and 15895 transitions. [2024-10-13 23:55:40,418 INFO L78 Accepts]: Start accepts. Automaton has 12987 states and 15895 transitions. Word has length 191 [2024-10-13 23:55:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:40,419 INFO L471 AbstractCegarLoop]: Abstraction has 12987 states and 15895 transitions. [2024-10-13 23:55:40,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12987 states and 15895 transitions. [2024-10-13 23:55:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-10-13 23:55:40,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:40,423 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:55:40,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -680829012, now seen corresponding path program 1 times [2024-10-13 23:55:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964586016] [2024-10-13 23:55:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-13 23:55:40,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:40,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964586016] [2024-10-13 23:55:40,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964586016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:40,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:40,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:40,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625207990] [2024-10-13 23:55:40,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:40,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:40,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:40,640 INFO L87 Difference]: Start difference. First operand 12987 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:42,630 INFO L93 Difference]: Finished difference Result 31486 states and 38491 transitions. [2024-10-13 23:55:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 288 [2024-10-13 23:55:42,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:42,659 INFO L225 Difference]: With dead ends: 31486 [2024-10-13 23:55:42,659 INFO L226 Difference]: Without dead ends: 17650 [2024-10-13 23:55:42,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:42,676 INFO L432 NwaCegarLoop]: 875 mSDtfsCounter, 408 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:42,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 943 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 23:55:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17650 states. [2024-10-13 23:55:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17650 to 12113. [2024-10-13 23:55:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12113 states, 12112 states have (on average 1.1775924702774108) internal successors, (14263), 12112 states have internal predecessors, (14263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12113 states to 12113 states and 14263 transitions. [2024-10-13 23:55:42,835 INFO L78 Accepts]: Start accepts. Automaton has 12113 states and 14263 transitions. Word has length 288 [2024-10-13 23:55:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:42,836 INFO L471 AbstractCegarLoop]: Abstraction has 12113 states and 14263 transitions. [2024-10-13 23:55:42,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 12113 states and 14263 transitions. [2024-10-13 23:55:42,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-10-13 23:55:42,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:42,840 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:55:42,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:55:42,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:42,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:42,841 INFO L85 PathProgramCache]: Analyzing trace with hash 291287026, now seen corresponding path program 1 times [2024-10-13 23:55:42,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444104614] [2024-10-13 23:55:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-10-13 23:55:43,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:43,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444104614] [2024-10-13 23:55:43,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444104614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:43,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602027697] [2024-10-13 23:55:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:43,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:43,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:43,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:43,037 INFO L87 Difference]: Start difference. First operand 12113 states and 14263 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:44,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:44,887 INFO L93 Difference]: Finished difference Result 31030 states and 36607 transitions. [2024-10-13 23:55:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 305 [2024-10-13 23:55:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:44,913 INFO L225 Difference]: With dead ends: 31030 [2024-10-13 23:55:44,914 INFO L226 Difference]: Without dead ends: 18918 [2024-10-13 23:55:44,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:44,928 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 455 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:44,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 399 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:55:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18918 states. [2024-10-13 23:55:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18918 to 16785. [2024-10-13 23:55:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16785 states, 16784 states have (on average 1.1661105815061963) internal successors, (19572), 16784 states have internal predecessors, (19572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16785 states to 16785 states and 19572 transitions. [2024-10-13 23:55:45,118 INFO L78 Accepts]: Start accepts. Automaton has 16785 states and 19572 transitions. Word has length 305 [2024-10-13 23:55:45,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:45,119 INFO L471 AbstractCegarLoop]: Abstraction has 16785 states and 19572 transitions. [2024-10-13 23:55:45,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 16785 states and 19572 transitions. [2024-10-13 23:55:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-13 23:55:45,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:45,127 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:55:45,127 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:45,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2069520865, now seen corresponding path program 1 times [2024-10-13 23:55:45,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:45,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087878472] [2024-10-13 23:55:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:45,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 23:55:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:45,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087878472] [2024-10-13 23:55:45,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087878472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:45,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:45,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:45,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86073144] [2024-10-13 23:55:45,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:45,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:45,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:45,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:45,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:45,442 INFO L87 Difference]: Start difference. First operand 16785 states and 19572 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:47,100 INFO L93 Difference]: Finished difference Result 40430 states and 47470 transitions. [2024-10-13 23:55:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 349 [2024-10-13 23:55:47,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:47,133 INFO L225 Difference]: With dead ends: 40430 [2024-10-13 23:55:47,133 INFO L226 Difference]: Without dead ends: 22796 [2024-10-13 23:55:47,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:47,149 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 381 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:47,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 913 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:55:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2024-10-13 23:55:47,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 22361. [2024-10-13 23:55:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22361 states, 22360 states have (on average 1.1453488372093024) internal successors, (25610), 22360 states have internal predecessors, (25610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22361 states to 22361 states and 25610 transitions. [2024-10-13 23:55:47,409 INFO L78 Accepts]: Start accepts. Automaton has 22361 states and 25610 transitions. Word has length 349 [2024-10-13 23:55:47,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:47,409 INFO L471 AbstractCegarLoop]: Abstraction has 22361 states and 25610 transitions. [2024-10-13 23:55:47,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22361 states and 25610 transitions. [2024-10-13 23:55:47,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2024-10-13 23:55:47,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:47,418 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:55:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:55:47,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1049100023, now seen corresponding path program 1 times [2024-10-13 23:55:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:47,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995941449] [2024-10-13 23:55:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:55:47,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:47,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995941449] [2024-10-13 23:55:47,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995941449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:47,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365282644] [2024-10-13 23:55:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:47,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:47,816 INFO L87 Difference]: Start difference. First operand 22361 states and 25610 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:49,555 INFO L93 Difference]: Finished difference Result 55814 states and 63976 transitions. [2024-10-13 23:55:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:49,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 356 [2024-10-13 23:55:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:49,600 INFO L225 Difference]: With dead ends: 55814 [2024-10-13 23:55:49,601 INFO L226 Difference]: Without dead ends: 33015 [2024-10-13 23:55:49,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:49,622 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 395 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:49,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 752 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:55:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33015 states. [2024-10-13 23:55:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33015 to 28328. [2024-10-13 23:55:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28328 states, 28327 states have (on average 1.1432908532495498) internal successors, (32386), 28327 states have internal predecessors, (32386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28328 states to 28328 states and 32386 transitions. [2024-10-13 23:55:49,971 INFO L78 Accepts]: Start accepts. Automaton has 28328 states and 32386 transitions. Word has length 356 [2024-10-13 23:55:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:49,971 INFO L471 AbstractCegarLoop]: Abstraction has 28328 states and 32386 transitions. [2024-10-13 23:55:49,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28328 states and 32386 transitions. [2024-10-13 23:55:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2024-10-13 23:55:49,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:49,981 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-13 23:55:49,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:55:49,982 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:49,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1886740536, now seen corresponding path program 1 times [2024-10-13 23:55:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84871014] [2024-10-13 23:55:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-10-13 23:55:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:50,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84871014] [2024-10-13 23:55:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84871014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:50,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271290115] [2024-10-13 23:55:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:50,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:50,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:50,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:50,375 INFO L87 Difference]: Start difference. First operand 28328 states and 32386 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:51,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:51,974 INFO L93 Difference]: Finished difference Result 70281 states and 80281 transitions. [2024-10-13 23:55:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 431 [2024-10-13 23:55:51,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:52,021 INFO L225 Difference]: With dead ends: 70281 [2024-10-13 23:55:52,022 INFO L226 Difference]: Without dead ends: 41088 [2024-10-13 23:55:52,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:52,049 INFO L432 NwaCegarLoop]: 610 mSDtfsCounter, 446 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:52,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 647 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:55:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41088 states. [2024-10-13 23:55:52,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41088 to 36399. [2024-10-13 23:55:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36399 states, 36398 states have (on average 1.1283587010275289) internal successors, (41070), 36398 states have internal predecessors, (41070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36399 states to 36399 states and 41070 transitions. [2024-10-13 23:55:52,653 INFO L78 Accepts]: Start accepts. Automaton has 36399 states and 41070 transitions. Word has length 431 [2024-10-13 23:55:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:52,653 INFO L471 AbstractCegarLoop]: Abstraction has 36399 states and 41070 transitions. [2024-10-13 23:55:52,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:52,654 INFO L276 IsEmpty]: Start isEmpty. Operand 36399 states and 41070 transitions. [2024-10-13 23:55:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-10-13 23:55:52,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:52,663 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-13 23:55:52,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:55:52,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1557761263, now seen corresponding path program 1 times [2024-10-13 23:55:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782082393] [2024-10-13 23:55:52,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 606 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 23:55:53,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:53,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782082393] [2024-10-13 23:55:53,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782082393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:53,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:53,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:55:53,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741136729] [2024-10-13 23:55:53,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:53,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:55:53,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:53,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:55:53,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:55:53,240 INFO L87 Difference]: Start difference. First operand 36399 states and 41070 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:55,774 INFO L93 Difference]: Finished difference Result 89019 states and 100634 transitions. [2024-10-13 23:55:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:55:55,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 435 [2024-10-13 23:55:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:55,830 INFO L225 Difference]: With dead ends: 89019 [2024-10-13 23:55:55,830 INFO L226 Difference]: Without dead ends: 52621 [2024-10-13 23:55:55,862 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-10-13 23:55:55,863 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 815 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:55,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 200 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:55:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52621 states. [2024-10-13 23:55:56,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52621 to 47076. [2024-10-13 23:55:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47076 states, 47075 states have (on average 1.1351460435475305) internal successors, (53437), 47075 states have internal predecessors, (53437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47076 states to 47076 states and 53437 transitions. [2024-10-13 23:55:56,417 INFO L78 Accepts]: Start accepts. Automaton has 47076 states and 53437 transitions. Word has length 435 [2024-10-13 23:55:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 47076 states and 53437 transitions. [2024-10-13 23:55:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 47076 states and 53437 transitions. [2024-10-13 23:55:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-13 23:55:56,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:56,428 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:55:56,429 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:56,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash 310832063, now seen corresponding path program 1 times [2024-10-13 23:55:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:56,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100096931] [2024-10-13 23:55:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:56,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:55:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:55:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:55:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100096931] [2024-10-13 23:55:56,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100096931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:55:56,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:55:56,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:55:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657534734] [2024-10-13 23:55:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:55:56,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:55:56,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:55:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:55:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:56,899 INFO L87 Difference]: Start difference. First operand 47076 states and 53437 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:55:58,525 INFO L93 Difference]: Finished difference Result 112879 states and 128588 transitions. [2024-10-13 23:55:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:55:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 454 [2024-10-13 23:55:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:55:58,588 INFO L225 Difference]: With dead ends: 112879 [2024-10-13 23:55:58,589 INFO L226 Difference]: Without dead ends: 65804 [2024-10-13 23:55:58,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:55:58,620 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 392 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:55:58,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 312 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:55:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65804 states. [2024-10-13 23:55:59,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65804 to 64512. [2024-10-13 23:55:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64512 states, 64511 states have (on average 1.127466633597371) internal successors, (72734), 64511 states have internal predecessors, (72734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64512 states to 64512 states and 72734 transitions. [2024-10-13 23:55:59,489 INFO L78 Accepts]: Start accepts. Automaton has 64512 states and 72734 transitions. Word has length 454 [2024-10-13 23:55:59,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:55:59,490 INFO L471 AbstractCegarLoop]: Abstraction has 64512 states and 72734 transitions. [2024-10-13 23:55:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:55:59,490 INFO L276 IsEmpty]: Start isEmpty. Operand 64512 states and 72734 transitions. [2024-10-13 23:55:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2024-10-13 23:55:59,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:55:59,499 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:55:59,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:55:59,500 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:55:59,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:55:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1869214909, now seen corresponding path program 1 times [2024-10-13 23:55:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:55:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111326543] [2024-10-13 23:55:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:55:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:55:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:56:00,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:00,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111326543] [2024-10-13 23:56:00,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111326543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:00,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:56:00,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:56:00,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006906785] [2024-10-13 23:56:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:00,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:56:00,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:56:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:00,352 INFO L87 Difference]: Start difference. First operand 64512 states and 72734 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:02,075 INFO L93 Difference]: Finished difference Result 142215 states and 159758 transitions. [2024-10-13 23:56:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:56:02,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 455 [2024-10-13 23:56:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:02,162 INFO L225 Difference]: With dead ends: 142215 [2024-10-13 23:56:02,162 INFO L226 Difference]: Without dead ends: 77279 [2024-10-13 23:56:02,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:02,200 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 368 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:02,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 806 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:56:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77279 states. [2024-10-13 23:56:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77279 to 74708. [2024-10-13 23:56:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74708 states, 74707 states have (on average 1.1155982705770544) internal successors, (83343), 74707 states have internal predecessors, (83343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74708 states to 74708 states and 83343 transitions. [2024-10-13 23:56:03,156 INFO L78 Accepts]: Start accepts. Automaton has 74708 states and 83343 transitions. Word has length 455 [2024-10-13 23:56:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 74708 states and 83343 transitions. [2024-10-13 23:56:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 74708 states and 83343 transitions. [2024-10-13 23:56:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-13 23:56:03,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:03,165 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:56:03,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:56:03,166 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:03,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:03,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1470424771, now seen corresponding path program 1 times [2024-10-13 23:56:03,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:03,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089046521] [2024-10-13 23:56:03,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:03,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-13 23:56:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089046521] [2024-10-13 23:56:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089046521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:56:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:56:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529208325] [2024-10-13 23:56:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:03,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:56:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:56:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:03,642 INFO L87 Difference]: Start difference. First operand 74708 states and 83343 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:05,387 INFO L93 Difference]: Finished difference Result 158784 states and 177329 transitions. [2024-10-13 23:56:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:56:05,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 473 [2024-10-13 23:56:05,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:05,483 INFO L225 Difference]: With dead ends: 158784 [2024-10-13 23:56:05,483 INFO L226 Difference]: Without dead ends: 84077 [2024-10-13 23:56:05,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:05,534 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 338 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:05,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 758 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:56:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84077 states. [2024-10-13 23:56:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84077 to 75529. [2024-10-13 23:56:06,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75529 states, 75528 states have (on average 1.1046764113970977) internal successors, (83434), 75528 states have internal predecessors, (83434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75529 states to 75529 states and 83434 transitions. [2024-10-13 23:56:06,479 INFO L78 Accepts]: Start accepts. Automaton has 75529 states and 83434 transitions. Word has length 473 [2024-10-13 23:56:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:06,480 INFO L471 AbstractCegarLoop]: Abstraction has 75529 states and 83434 transitions. [2024-10-13 23:56:06,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75529 states and 83434 transitions. [2024-10-13 23:56:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-13 23:56:06,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:06,487 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:56:06,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:56:06,488 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:06,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:06,488 INFO L85 PathProgramCache]: Analyzing trace with hash 365353125, now seen corresponding path program 1 times [2024-10-13 23:56:06,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:06,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193657912] [2024-10-13 23:56:06,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:06,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:07,082 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-13 23:56:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:07,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193657912] [2024-10-13 23:56:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193657912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:07,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:56:07,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:56:07,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314076379] [2024-10-13 23:56:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:07,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:56:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:56:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:07,085 INFO L87 Difference]: Start difference. First operand 75529 states and 83434 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:09,041 INFO L93 Difference]: Finished difference Result 166392 states and 183604 transitions. [2024-10-13 23:56:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:56:09,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 478 [2024-10-13 23:56:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:09,146 INFO L225 Difference]: With dead ends: 166392 [2024-10-13 23:56:09,147 INFO L226 Difference]: Without dead ends: 90864 [2024-10-13 23:56:09,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:09,202 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 290 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:09,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 808 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:56:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90864 states. [2024-10-13 23:56:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90864 to 89991. [2024-10-13 23:56:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89991 states, 89990 states have (on average 1.0961106789643293) internal successors, (98639), 89990 states have internal predecessors, (98639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89991 states to 89991 states and 98639 transitions. [2024-10-13 23:56:10,474 INFO L78 Accepts]: Start accepts. Automaton has 89991 states and 98639 transitions. Word has length 478 [2024-10-13 23:56:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 89991 states and 98639 transitions. [2024-10-13 23:56:10,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 89991 states and 98639 transitions. [2024-10-13 23:56:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-10-13 23:56:10,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:10,486 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:56:10,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 23:56:10,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:10,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1826834041, now seen corresponding path program 1 times [2024-10-13 23:56:10,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274339972] [2024-10-13 23:56:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:10,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:56:10,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:10,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274339972] [2024-10-13 23:56:10,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274339972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:10,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:56:10,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:56:10,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195828034] [2024-10-13 23:56:10,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:10,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:56:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:10,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:56:10,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:10,809 INFO L87 Difference]: Start difference. First operand 89991 states and 98639 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:12,786 INFO L93 Difference]: Finished difference Result 191076 states and 209689 transitions. [2024-10-13 23:56:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:56:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 478 [2024-10-13 23:56:12,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:13,190 INFO L225 Difference]: With dead ends: 191076 [2024-10-13 23:56:13,190 INFO L226 Difference]: Without dead ends: 100657 [2024-10-13 23:56:13,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:56:13,230 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 435 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:13,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 243 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 23:56:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100657 states. [2024-10-13 23:56:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100657 to 97652. [2024-10-13 23:56:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97652 states, 97651 states have (on average 1.0970496973917319) internal successors, (107128), 97651 states have internal predecessors, (107128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97652 states to 97652 states and 107128 transitions. [2024-10-13 23:56:14,437 INFO L78 Accepts]: Start accepts. Automaton has 97652 states and 107128 transitions. Word has length 478 [2024-10-13 23:56:14,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 97652 states and 107128 transitions. [2024-10-13 23:56:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 97652 states and 107128 transitions. [2024-10-13 23:56:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-10-13 23:56:14,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:14,445 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:56:14,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:56:14,445 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:14,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1601743320, now seen corresponding path program 1 times [2024-10-13 23:56:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:14,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811048627] [2024-10-13 23:56:14,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:14,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:15,220 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 17 proven. 84 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 23:56:15,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811048627] [2024-10-13 23:56:15,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811048627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:56:15,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103495201] [2024-10-13 23:56:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:15,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:56:15,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:56:15,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:56:15,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:56:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:15,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:56:15,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:56:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-13 23:56:15,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:56:15,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103495201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:15,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:56:15,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:56:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230669566] [2024-10-13 23:56:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:15,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:56:15,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:15,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:56:15,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:56:15,460 INFO L87 Difference]: Start difference. First operand 97652 states and 107128 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:17,230 INFO L93 Difference]: Finished difference Result 194448 states and 213227 transitions. [2024-10-13 23:56:17,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:56:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2024-10-13 23:56:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:17,328 INFO L225 Difference]: With dead ends: 194448 [2024-10-13 23:56:17,328 INFO L226 Difference]: Without dead ends: 96369 [2024-10-13 23:56:17,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:56:17,375 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 436 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:17,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 325 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:56:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96369 states. [2024-10-13 23:56:18,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96369 to 90405. [2024-10-13 23:56:18,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90405 states, 90404 states have (on average 1.0876952347241273) internal successors, (98332), 90404 states have internal predecessors, (98332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90405 states to 90405 states and 98332 transitions. [2024-10-13 23:56:18,539 INFO L78 Accepts]: Start accepts. Automaton has 90405 states and 98332 transitions. Word has length 481 [2024-10-13 23:56:18,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:18,540 INFO L471 AbstractCegarLoop]: Abstraction has 90405 states and 98332 transitions. [2024-10-13 23:56:18,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 90405 states and 98332 transitions. [2024-10-13 23:56:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2024-10-13 23:56:18,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:18,554 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-13 23:56:18,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:56:18,754 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,SelfDestructingSolverStorable19 [2024-10-13 23:56:18,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:18,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1049378488, now seen corresponding path program 1 times [2024-10-13 23:56:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287382814] [2024-10-13 23:56:18,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 532 proven. 108 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-13 23:56:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287382814] [2024-10-13 23:56:20,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287382814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:56:20,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147737751] [2024-10-13 23:56:20,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:20,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:56:20,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:56:20,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:56:20,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:56:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:20,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 23:56:20,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:56:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:56:21,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:56:21,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147737751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:56:21,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:56:21,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-13 23:56:21,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694228349] [2024-10-13 23:56:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:56:21,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:56:21,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:56:21,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:56:21,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:56:21,055 INFO L87 Difference]: Start difference. First operand 90405 states and 98332 transitions. Second operand has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:24,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:56:24,552 INFO L93 Difference]: Finished difference Result 222588 states and 242221 transitions. [2024-10-13 23:56:24,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:56:24,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 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 512 [2024-10-13 23:56:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:56:24,709 INFO L225 Difference]: With dead ends: 222588 [2024-10-13 23:56:24,709 INFO L226 Difference]: Without dead ends: 131759 [2024-10-13 23:56:24,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 511 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:56:24,760 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 805 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:56:24,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 225 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 23:56:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131759 states. [2024-10-13 23:56:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131759 to 102357. [2024-10-13 23:56:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102357 states, 102356 states have (on average 1.0874399155887295) internal successors, (111306), 102356 states have internal predecessors, (111306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102357 states to 102357 states and 111306 transitions. [2024-10-13 23:56:26,030 INFO L78 Accepts]: Start accepts. Automaton has 102357 states and 111306 transitions. Word has length 512 [2024-10-13 23:56:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:56:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 102357 states and 111306 transitions. [2024-10-13 23:56:26,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:56:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 102357 states and 111306 transitions. [2024-10-13 23:56:26,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-10-13 23:56:26,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:56:26,040 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-13 23:56:26,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 23:56:26,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:56:26,241 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:56:26,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:56:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash -171213728, now seen corresponding path program 1 times [2024-10-13 23:56:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:56:26,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729317556] [2024-10-13 23:56:26,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:26,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:56:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 336 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:56:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:56:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729317556] [2024-10-13 23:56:27,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729317556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:56:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009325472] [2024-10-13 23:56:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:56:27,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:56:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:56:27,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:56:27,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:56:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:56:27,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 23:56:27,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:56:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 254 proven. 82 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 23:56:28,403 INFO L311 TraceCheckSpWp]: Computing backward predicates...