./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/Problem03_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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/Problem03_label44.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 37cccb3bf38aef2358990f5bb72c991902624e4b903b7b6aaef89921bb90a94d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:20:00,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:20:01,051 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:20:01,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:20:01,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:20:01,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:20:01,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:20:01,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:20:01,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:20:01,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:20:01,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:20:01,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:20:01,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:20:01,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:20:01,084 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:20:01,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:20:01,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:20:01,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:20:01,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:20:01,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:20:01,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:20:01,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:20:01,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:20:01,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:20:01,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:20:01,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:20:01,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:20:01,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:20:01,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:20:01,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:01,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:20:01,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:20:01,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:20:01,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:20:01,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:20:01,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:20:01,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:20:01,091 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 -> 37cccb3bf38aef2358990f5bb72c991902624e4b903b7b6aaef89921bb90a94d [2024-10-12 15:20:01,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:20:01,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:20:01,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:20:01,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:20:01,315 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:20:01,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2024-10-12 15:20:02,538 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:20:02,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:20:02,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2024-10-12 15:20:02,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab3fc45f/36ea9bd9ec9a462bb80079e3ef2225da/FLAG201eaf0e4 [2024-10-12 15:20:02,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab3fc45f/36ea9bd9ec9a462bb80079e3ef2225da [2024-10-12 15:20:02,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:20:02,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:20:02,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:02,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:20:02,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:20:02,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:02" (1/1) ... [2024-10-12 15:20:02,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c16fe65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:02, skipping insertion in model container [2024-10-12 15:20:02,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:20:02" (1/1) ... [2024-10-12 15:20:02,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:20:03,308 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/Problem03_label44.c[58121,58134] [2024-10-12 15:20:03,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:03,344 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:20:03,459 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/Problem03_label44.c[58121,58134] [2024-10-12 15:20:03,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:20:03,484 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:20:03,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03 WrapperNode [2024-10-12 15:20:03,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:20:03,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:20:03,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:20:03,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:20:03,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,582 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-12 15:20:03,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:20:03,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:20:03,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:20:03,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:20:03,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,641 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-12 15:20:03,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:20:03,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:20:03,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:20:03,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:20:03,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (1/1) ... [2024-10-12 15:20:03,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:20:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:03,745 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-12 15:20:03,748 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-12 15:20:03,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:20:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:20:03,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:20:03,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:20:03,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:20:03,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:20:05,182 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-12 15:20:05,182 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:20:05,242 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:20:05,244 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:20:05,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:20:05 BoogieIcfgContainer [2024-10-12 15:20:05,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:20:05,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:20:05,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:20:05,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:20:05,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:20:02" (1/3) ... [2024-10-12 15:20:05,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e68c5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:20:05, skipping insertion in model container [2024-10-12 15:20:05,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:20:03" (2/3) ... [2024-10-12 15:20:05,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e68c5b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:20:05, skipping insertion in model container [2024-10-12 15:20:05,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:20:05" (3/3) ... [2024-10-12 15:20:05,252 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2024-10-12 15:20:05,265 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:20:05,266 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:20:05,318 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:20:05,326 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;@2e9e78f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:20:05,327 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:20:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-12 15:20:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-12 15:20:05,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:05,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:05,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:05,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2015107433, now seen corresponding path program 1 times [2024-10-12 15:20:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554586241] [2024-10-12 15:20:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:05,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:05,752 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-12 15:20:05,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:05,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554586241] [2024-10-12 15:20:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554586241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427919821] [2024-10-12 15:20:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:05,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:20:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:20:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:20:05,777 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 0 states have call successors, (0), 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 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-12 15:20:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:05,810 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-12 15:20:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:20:05,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2024-10-12 15:20:05,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:05,821 INFO L225 Difference]: With dead ends: 479 [2024-10-12 15:20:05,821 INFO L226 Difference]: Without dead ends: 238 [2024-10-12 15:20:05,824 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-12 15:20:05,826 INFO L432 NwaCegarLoop]: 392 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, 392 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-12 15:20:05,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:20:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-12 15:20:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-12 15:20:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-12 15:20:05,874 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 176 [2024-10-12 15:20:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-12 15:20:05,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-12 15:20:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-12 15:20:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-12 15:20:05,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:05,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:05,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:20:05,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:05,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash 841366142, now seen corresponding path program 1 times [2024-10-12 15:20:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:05,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309205088] [2024-10-12 15:20:05,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:05,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:06,310 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-12 15:20:06,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309205088] [2024-10-12 15:20:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309205088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:06,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:06,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326552346] [2024-10-12 15:20:06,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:06,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:06,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:06,314 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-12 15:20:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:07,028 INFO L93 Difference]: Finished difference Result 696 states and 1149 transitions. [2024-10-12 15:20:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 176 [2024-10-12 15:20:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:07,034 INFO L225 Difference]: With dead ends: 696 [2024-10-12 15:20:07,034 INFO L226 Difference]: Without dead ends: 459 [2024-10-12 15:20:07,035 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-12 15:20:07,036 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 87 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:07,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 137 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-12 15:20:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2024-10-12 15:20:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 457 states have internal predecessors, (709), 0 states have call successors, (0), 0 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-12 15:20:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 709 transitions. [2024-10-12 15:20:07,050 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 709 transitions. Word has length 176 [2024-10-12 15:20:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:07,050 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 709 transitions. [2024-10-12 15:20:07,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 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-12 15:20:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 709 transitions. [2024-10-12 15:20:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 15:20:07,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:07,058 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:20:07,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:20:07,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1980218360, now seen corresponding path program 1 times [2024-10-12 15:20:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518411033] [2024-10-12 15:20:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518411033] [2024-10-12 15:20:07,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518411033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:07,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:07,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:07,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380177802] [2024-10-12 15:20:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:07,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:07,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:07,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:07,316 INFO L87 Difference]: Start difference. First operand 458 states and 709 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:08,011 INFO L93 Difference]: Finished difference Result 1341 states and 2081 transitions. [2024-10-12 15:20:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:08,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-12 15:20:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:08,014 INFO L225 Difference]: With dead ends: 1341 [2024-10-12 15:20:08,014 INFO L226 Difference]: Without dead ends: 884 [2024-10-12 15:20:08,016 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-12 15:20:08,017 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:08,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 179 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-12 15:20:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 879. [2024-10-12 15:20:08,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.469248291571754) internal successors, (1290), 878 states have internal predecessors, (1290), 0 states have call successors, (0), 0 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-12 15:20:08,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1290 transitions. [2024-10-12 15:20:08,044 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1290 transitions. Word has length 181 [2024-10-12 15:20:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:08,044 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1290 transitions. [2024-10-12 15:20:08,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 2 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:08,045 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1290 transitions. [2024-10-12 15:20:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-12 15:20:08,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:08,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:20:08,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:08,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1100922815, now seen corresponding path program 1 times [2024-10-12 15:20:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439369447] [2024-10-12 15:20:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:08,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:08,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439369447] [2024-10-12 15:20:08,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439369447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:08,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:08,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:08,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258633850] [2024-10-12 15:20:08,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:08,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:08,177 INFO L87 Difference]: Start difference. First operand 879 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-12 15:20:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:08,888 INFO L93 Difference]: Finished difference Result 2593 states and 3821 transitions. [2024-10-12 15:20:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2024-10-12 15:20:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:08,893 INFO L225 Difference]: With dead ends: 2593 [2024-10-12 15:20:08,894 INFO L226 Difference]: Without dead ends: 1715 [2024-10-12 15:20:08,895 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-12 15:20:08,898 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:08,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 88 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 15:20:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-12 15:20:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1695. [2024-10-12 15:20:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.4397874852420307) internal successors, (2439), 1694 states have internal predecessors, (2439), 0 states have call successors, (0), 0 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-12 15:20:08,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2439 transitions. [2024-10-12 15:20:08,927 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2439 transitions. Word has length 184 [2024-10-12 15:20:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:08,928 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2439 transitions. [2024-10-12 15:20:08,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-12 15:20:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2439 transitions. [2024-10-12 15:20:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-12 15:20:08,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:08,931 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-12 15:20:08,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:20:08,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:08,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1093556594, now seen corresponding path program 1 times [2024-10-12 15:20:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308275262] [2024-10-12 15:20:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:09,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308275262] [2024-10-12 15:20:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308275262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:09,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:09,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689733994] [2024-10-12 15:20:09,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:09,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:09,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:09,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:09,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:09,396 INFO L87 Difference]: Start difference. First operand 1695 states and 2439 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:20:10,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:10,212 INFO L93 Difference]: Finished difference Result 3530 states and 5129 transitions. [2024-10-12 15:20:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:10,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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-12 15:20:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:10,218 INFO L225 Difference]: With dead ends: 3530 [2024-10-12 15:20:10,219 INFO L226 Difference]: Without dead ends: 1662 [2024-10-12 15:20:10,221 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-12 15:20:10,222 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 331 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:10,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 44 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:20:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-10-12 15:20:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2024-10-12 15:20:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.3257074051776039) internal successors, (2202), 1661 states have internal predecessors, (2202), 0 states have call successors, (0), 0 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-12 15:20:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2202 transitions. [2024-10-12 15:20:10,254 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2202 transitions. Word has length 191 [2024-10-12 15:20:10,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:10,254 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2202 transitions. [2024-10-12 15:20:10,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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-12 15:20:10,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2202 transitions. [2024-10-12 15:20:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-12 15:20:10,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:10,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:10,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:20:10,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:10,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:10,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1600395689, now seen corresponding path program 1 times [2024-10-12 15:20:10,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:10,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043226082] [2024-10-12 15:20:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:10,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:10,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043226082] [2024-10-12 15:20:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043226082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:10,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584993] [2024-10-12 15:20:10,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:10,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:10,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:10,766 INFO L87 Difference]: Start difference. First operand 1662 states and 2202 transitions. Second operand has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-12 15:20:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:11,654 INFO L93 Difference]: Finished difference Result 4322 states and 5742 transitions. [2024-10-12 15:20:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:11,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-10-12 15:20:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:11,661 INFO L225 Difference]: With dead ends: 4322 [2024-10-12 15:20:11,661 INFO L226 Difference]: Without dead ends: 2487 [2024-10-12 15:20:11,663 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-12 15:20:11,664 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 193 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:11,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 97 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 15:20:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-10-12 15:20:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2486. [2024-10-12 15:20:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2485 states have (on average 1.3086519114688129) internal successors, (3252), 2485 states have internal predecessors, (3252), 0 states have call successors, (0), 0 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-12 15:20:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3252 transitions. [2024-10-12 15:20:11,694 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3252 transitions. Word has length 207 [2024-10-12 15:20:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:11,695 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 3252 transitions. [2024-10-12 15:20:11,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.75) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-12 15:20:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3252 transitions. [2024-10-12 15:20:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-12 15:20:11,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:11,698 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:11,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 15:20:11,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:11,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash 964587886, now seen corresponding path program 1 times [2024-10-12 15:20:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:11,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145149328] [2024-10-12 15:20:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-12 15:20:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145149328] [2024-10-12 15:20:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145149328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:11,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:11,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:11,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73411636] [2024-10-12 15:20:11,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:11,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:11,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:11,893 INFO L87 Difference]: Start difference. First operand 2486 states and 3252 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-12 15:20:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:12,414 INFO L93 Difference]: Finished difference Result 6627 states and 8643 transitions. [2024-10-12 15:20:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:12,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 209 [2024-10-12 15:20:12,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:12,427 INFO L225 Difference]: With dead ends: 6627 [2024-10-12 15:20:12,427 INFO L226 Difference]: Without dead ends: 4142 [2024-10-12 15:20:12,430 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-12 15:20:12,431 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:12,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 115 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:12,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2024-10-12 15:20:12,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 4139. [2024-10-12 15:20:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 1.2974867085548574) internal successors, (5369), 4138 states have internal predecessors, (5369), 0 states have call successors, (0), 0 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-12 15:20:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 5369 transitions. [2024-10-12 15:20:12,484 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 5369 transitions. Word has length 209 [2024-10-12 15:20:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:12,485 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 5369 transitions. [2024-10-12 15:20:12,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 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-12 15:20:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 5369 transitions. [2024-10-12 15:20:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-12 15:20:12,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:12,490 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:20:12,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1435564538, now seen corresponding path program 1 times [2024-10-12 15:20:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699221801] [2024-10-12 15:20:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:12,848 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:12,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699221801] [2024-10-12 15:20:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699221801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019401188] [2024-10-12 15:20:12,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:12,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:12,850 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-12 15:20:12,851 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-12 15:20:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:12,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:12,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 15:20:13,178 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:13,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019401188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:13,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616579710] [2024-10-12 15:20:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:13,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:13,180 INFO L87 Difference]: Start difference. First operand 4139 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-12 15:20:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:13,703 INFO L93 Difference]: Finished difference Result 8286 states and 10753 transitions. [2024-10-12 15:20:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:13,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2024-10-12 15:20:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:13,713 INFO L225 Difference]: With dead ends: 8286 [2024-10-12 15:20:13,713 INFO L226 Difference]: Without dead ends: 4148 [2024-10-12 15:20:13,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:13,718 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 47 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:13,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 317 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4148 states. [2024-10-12 15:20:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4148 to 4139. [2024-10-12 15:20:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 1.2868535524407927) internal successors, (5325), 4138 states have internal predecessors, (5325), 0 states have call successors, (0), 0 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-12 15:20:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 5325 transitions. [2024-10-12 15:20:13,768 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 5325 transitions. Word has length 214 [2024-10-12 15:20:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:13,768 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 5325 transitions. [2024-10-12 15:20:13,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 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-12 15:20:13,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 5325 transitions. [2024-10-12 15:20:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:20:13,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:13,774 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:13,787 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-12 15:20:13,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:13,981 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2035670570, now seen corresponding path program 1 times [2024-10-12 15:20:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491121191] [2024-10-12 15:20:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:14,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491121191] [2024-10-12 15:20:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491121191] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:14,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287946517] [2024-10-12 15:20:14,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:14,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:14,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:14,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-12 15:20:14,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-12 15:20:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:14,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:14,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 15:20:14,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:14,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287946517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:14,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:14,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24402934] [2024-10-12 15:20:14,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:14,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:14,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:14,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:14,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:14,528 INFO L87 Difference]: Start difference. First operand 4139 states and 5325 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:15,016 INFO L93 Difference]: Finished difference Result 12343 states and 15879 transitions. [2024-10-12 15:20:15,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:15,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-10-12 15:20:15,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:15,036 INFO L225 Difference]: With dead ends: 12343 [2024-10-12 15:20:15,036 INFO L226 Difference]: Without dead ends: 8205 [2024-10-12 15:20:15,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:15,044 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 42 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:15,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 340 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8205 states. [2024-10-12 15:20:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8205 to 8199. [2024-10-12 15:20:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8199 states, 8198 states have (on average 1.1768724079043669) internal successors, (9648), 8198 states have internal predecessors, (9648), 0 states have call successors, (0), 0 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-12 15:20:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8199 states to 8199 states and 9648 transitions. [2024-10-12 15:20:15,136 INFO L78 Accepts]: Start accepts. Automaton has 8199 states and 9648 transitions. Word has length 220 [2024-10-12 15:20:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 8199 states and 9648 transitions. [2024-10-12 15:20:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:20:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 9648 transitions. [2024-10-12 15:20:15,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-12 15:20:15,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:15,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:15,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:20:15,345 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,SelfDestructingSolverStorable8 [2024-10-12 15:20:15,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:15,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:15,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1577968896, now seen corresponding path program 1 times [2024-10-12 15:20:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:15,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398959475] [2024-10-12 15:20:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:15,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:15,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398959475] [2024-10-12 15:20:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398959475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:15,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779912514] [2024-10-12 15:20:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:15,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:15,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:15,506 INFO L87 Difference]: Start difference. First operand 8199 states and 9648 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:20:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:15,977 INFO L93 Difference]: Finished difference Result 20463 states and 24525 transitions. [2024-10-12 15:20:15,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:15,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2024-10-12 15:20:15,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:16,000 INFO L225 Difference]: With dead ends: 20463 [2024-10-12 15:20:16,000 INFO L226 Difference]: Without dead ends: 12265 [2024-10-12 15:20:16,009 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-12 15:20:16,009 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 179 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:16,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 112 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12265 states. [2024-10-12 15:20:16,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12265 to 12259. [2024-10-12 15:20:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12259 states, 12258 states have (on average 1.1492086800456844) internal successors, (14087), 12258 states have internal predecessors, (14087), 0 states have call successors, (0), 0 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-12 15:20:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12259 states to 12259 states and 14087 transitions. [2024-10-12 15:20:16,141 INFO L78 Accepts]: Start accepts. Automaton has 12259 states and 14087 transitions. Word has length 220 [2024-10-12 15:20:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 12259 states and 14087 transitions. [2024-10-12 15:20:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:20:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12259 states and 14087 transitions. [2024-10-12 15:20:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-12 15:20:16,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:16,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:16,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:20:16,154 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1260263501, now seen corresponding path program 1 times [2024-10-12 15:20:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850138590] [2024-10-12 15:20:16,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850138590] [2024-10-12 15:20:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850138590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739445659] [2024-10-12 15:20:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:16,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:16,455 INFO L87 Difference]: Start difference. First operand 12259 states and 14087 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-12 15:20:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:17,005 INFO L93 Difference]: Finished difference Result 34300 states and 39540 transitions. [2024-10-12 15:20:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2024-10-12 15:20:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:17,046 INFO L225 Difference]: With dead ends: 34300 [2024-10-12 15:20:17,047 INFO L226 Difference]: Without dead ends: 22042 [2024-10-12 15:20:17,061 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-12 15:20:17,061 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:17,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 148 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:17,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22042 states. [2024-10-12 15:20:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22042 to 19577. [2024-10-12 15:20:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19577 states, 19576 states have (on average 1.163261136085002) internal successors, (22772), 19576 states have internal predecessors, (22772), 0 states have call successors, (0), 0 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-12 15:20:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19577 states to 19577 states and 22772 transitions. [2024-10-12 15:20:17,301 INFO L78 Accepts]: Start accepts. Automaton has 19577 states and 22772 transitions. Word has length 251 [2024-10-12 15:20:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:17,301 INFO L471 AbstractCegarLoop]: Abstraction has 19577 states and 22772 transitions. [2024-10-12 15:20:17,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-12 15:20:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 19577 states and 22772 transitions. [2024-10-12 15:20:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-10-12 15:20:17,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:17,317 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:17,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 15:20:17,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:17,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1086878037, now seen corresponding path program 1 times [2024-10-12 15:20:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499705229] [2024-10-12 15:20:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:20:18,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499705229] [2024-10-12 15:20:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499705229] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:18,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097816403] [2024-10-12 15:20:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:18,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:18,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:18,130 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-12 15:20:18,132 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-12 15:20:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:18,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:20:18,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:18,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:18,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097816403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:18,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:18,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:18,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424640408] [2024-10-12 15:20:18,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:18,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:18,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:18,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:18,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:18,403 INFO L87 Difference]: Start difference. First operand 19577 states and 22772 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-12 15:20:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:18,892 INFO L93 Difference]: Finished difference Result 39159 states and 45553 transitions. [2024-10-12 15:20:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 256 [2024-10-12 15:20:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:18,921 INFO L225 Difference]: With dead ends: 39159 [2024-10-12 15:20:18,922 INFO L226 Difference]: Without dead ends: 19583 [2024-10-12 15:20:18,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:18,936 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 86 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:18,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 274 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19583 states. [2024-10-12 15:20:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19583 to 18765. [2024-10-12 15:20:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18765 states, 18764 states have (on average 1.1510338946919634) internal successors, (21598), 18764 states have internal predecessors, (21598), 0 states have call successors, (0), 0 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-12 15:20:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18765 states to 18765 states and 21598 transitions. [2024-10-12 15:20:19,197 INFO L78 Accepts]: Start accepts. Automaton has 18765 states and 21598 transitions. Word has length 256 [2024-10-12 15:20:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:19,198 INFO L471 AbstractCegarLoop]: Abstraction has 18765 states and 21598 transitions. [2024-10-12 15:20:19,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 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-12 15:20:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18765 states and 21598 transitions. [2024-10-12 15:20:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-12 15:20:19,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:19,214 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:19,228 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-12 15:20:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:19,415 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:19,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:19,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1136116003, now seen corresponding path program 1 times [2024-10-12 15:20:19,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:19,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073144595] [2024-10-12 15:20:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 87 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 15:20:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073144595] [2024-10-12 15:20:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073144595] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927799609] [2024-10-12 15:20:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:19,799 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-12 15:20:19,801 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-12 15:20:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:19,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:19,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:19,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927799609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247338049] [2024-10-12 15:20:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:19,994 INFO L87 Difference]: Start difference. First operand 18765 states and 21598 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-12 15:20:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:20,493 INFO L93 Difference]: Finished difference Result 47909 states and 55101 transitions. [2024-10-12 15:20:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:20,493 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 258 [2024-10-12 15:20:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:20,538 INFO L225 Difference]: With dead ends: 47909 [2024-10-12 15:20:20,538 INFO L226 Difference]: Without dead ends: 29145 [2024-10-12 15:20:20,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 15:20:20,559 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:20,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 345 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29145 states. [2024-10-12 15:20:20,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29145 to 29136. [2024-10-12 15:20:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29136 states, 29135 states have (on average 1.1352325381843145) internal successors, (33075), 29135 states have internal predecessors, (33075), 0 states have call successors, (0), 0 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-12 15:20:20,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29136 states to 29136 states and 33075 transitions. [2024-10-12 15:20:20,851 INFO L78 Accepts]: Start accepts. Automaton has 29136 states and 33075 transitions. Word has length 258 [2024-10-12 15:20:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:20,853 INFO L471 AbstractCegarLoop]: Abstraction has 29136 states and 33075 transitions. [2024-10-12 15:20:20,854 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-12 15:20:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 29136 states and 33075 transitions. [2024-10-12 15:20:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2024-10-12 15:20:20,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:20,878 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:20,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:21,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:21,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1176075598, now seen corresponding path program 1 times [2024-10-12 15:20:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495113676] [2024-10-12 15:20:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:21,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 125 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-12 15:20:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495113676] [2024-10-12 15:20:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495113676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357261273] [2024-10-12 15:20:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:21,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:21,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:21,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:21,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 15:20:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:22,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:22,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 15:20:22,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:22,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357261273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:22,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:22,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744171995] [2024-10-12 15:20:22,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:22,136 INFO L87 Difference]: Start difference. First operand 29136 states and 33075 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-12 15:20:22,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:22,638 INFO L93 Difference]: Finished difference Result 55807 states and 63195 transitions. [2024-10-12 15:20:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:22,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 298 [2024-10-12 15:20:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:22,667 INFO L225 Difference]: With dead ends: 55807 [2024-10-12 15:20:22,667 INFO L226 Difference]: Without dead ends: 26672 [2024-10-12 15:20:22,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:22,687 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 200 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:22,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 309 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26672 states. [2024-10-12 15:20:22,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26672 to 25654. [2024-10-12 15:20:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25654 states, 25653 states have (on average 1.1062643745370913) internal successors, (28379), 25653 states have internal predecessors, (28379), 0 states have call successors, (0), 0 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-12 15:20:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25654 states to 25654 states and 28379 transitions. [2024-10-12 15:20:23,030 INFO L78 Accepts]: Start accepts. Automaton has 25654 states and 28379 transitions. Word has length 298 [2024-10-12 15:20:23,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:23,030 INFO L471 AbstractCegarLoop]: Abstraction has 25654 states and 28379 transitions. [2024-10-12 15:20:23,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-12 15:20:23,031 INFO L276 IsEmpty]: Start isEmpty. Operand 25654 states and 28379 transitions. [2024-10-12 15:20:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-10-12 15:20:23,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:23,052 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 15:20:23,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 15:20:23,252 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1980372537, now seen corresponding path program 1 times [2024-10-12 15:20:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809352984] [2024-10-12 15:20:23,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:23,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:24,228 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-12 15:20:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809352984] [2024-10-12 15:20:24,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809352984] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:24,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877683227] [2024-10-12 15:20:24,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:24,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:24,229 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:24,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 15:20:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:24,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:24,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:20:24,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877683227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:24,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:20:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369197487] [2024-10-12 15:20:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:24,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:24,395 INFO L87 Difference]: Start difference. First operand 25654 states and 28379 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-12 15:20:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:24,881 INFO L93 Difference]: Finished difference Result 61477 states and 68202 transitions. [2024-10-12 15:20:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:24,882 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 313 [2024-10-12 15:20:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:24,917 INFO L225 Difference]: With dead ends: 61477 [2024-10-12 15:20:24,917 INFO L226 Difference]: Without dead ends: 35824 [2024-10-12 15:20:24,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:24,938 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 204 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:24,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 313 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35824 states. [2024-10-12 15:20:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35824 to 34789. [2024-10-12 15:20:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34789 states, 34788 states have (on average 1.108370702541106) internal successors, (38558), 34788 states have internal predecessors, (38558), 0 states have call successors, (0), 0 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-12 15:20:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34789 states to 34789 states and 38558 transitions. [2024-10-12 15:20:25,312 INFO L78 Accepts]: Start accepts. Automaton has 34789 states and 38558 transitions. Word has length 313 [2024-10-12 15:20:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:25,312 INFO L471 AbstractCegarLoop]: Abstraction has 34789 states and 38558 transitions. [2024-10-12 15:20:25,312 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-12 15:20:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 34789 states and 38558 transitions. [2024-10-12 15:20:25,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-10-12 15:20:25,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:25,337 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 15:20:25,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 15:20:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-12 15:20:25,538 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1760540483, now seen corresponding path program 1 times [2024-10-12 15:20:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:25,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397307831] [2024-10-12 15:20:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-12 15:20:25,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397307831] [2024-10-12 15:20:25,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397307831] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:25,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836770523] [2024-10-12 15:20:25,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:25,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:25,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:25,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:25,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 15:20:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:26,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:20:26,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-12 15:20:26,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:26,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836770523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:26,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:26,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982645057] [2024-10-12 15:20:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:26,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:26,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:26,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:26,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:26,183 INFO L87 Difference]: Start difference. First operand 34789 states and 38558 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-12 15:20:26,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:26,935 INFO L93 Difference]: Finished difference Result 72424 states and 80131 transitions. [2024-10-12 15:20:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:26,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 332 [2024-10-12 15:20:26,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:26,971 INFO L225 Difference]: With dead ends: 72424 [2024-10-12 15:20:26,971 INFO L226 Difference]: Without dead ends: 37636 [2024-10-12 15:20:26,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:26,991 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 554 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:26,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 116 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37636 states. [2024-10-12 15:20:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37636 to 35601. [2024-10-12 15:20:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35601 states, 35600 states have (on average 1.1034550561797754) internal successors, (39283), 35600 states have internal predecessors, (39283), 0 states have call successors, (0), 0 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-12 15:20:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35601 states to 35601 states and 39283 transitions. [2024-10-12 15:20:27,361 INFO L78 Accepts]: Start accepts. Automaton has 35601 states and 39283 transitions. Word has length 332 [2024-10-12 15:20:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:27,362 INFO L471 AbstractCegarLoop]: Abstraction has 35601 states and 39283 transitions. [2024-10-12 15:20:27,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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-12 15:20:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35601 states and 39283 transitions. [2024-10-12 15:20:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-12 15:20:27,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:27,389 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-12 15:20:27,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:27,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:27,590 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:27,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1510283991, now seen corresponding path program 1 times [2024-10-12 15:20:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873211845] [2024-10-12 15:20:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 15:20:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873211845] [2024-10-12 15:20:28,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873211845] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513694330] [2024-10-12 15:20:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:28,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:28,042 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:28,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 15:20:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:28,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:20:28,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 15:20:28,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513694330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:28,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:28,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528359922] [2024-10-12 15:20:28,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:28,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:28,318 INFO L87 Difference]: Start difference. First operand 35601 states and 39283 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-12 15:20:29,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:29,074 INFO L93 Difference]: Finished difference Result 96813 states and 106726 transitions. [2024-10-12 15:20:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:29,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 360 [2024-10-12 15:20:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:29,146 INFO L225 Difference]: With dead ends: 96813 [2024-10-12 15:20:29,146 INFO L226 Difference]: Without dead ends: 61213 [2024-10-12 15:20:29,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:29,181 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 721 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:29,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 287 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61213 states. [2024-10-12 15:20:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61213 to 57959. [2024-10-12 15:20:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57959 states, 57958 states have (on average 1.1028503399013079) internal successors, (63919), 57958 states have internal predecessors, (63919), 0 states have call successors, (0), 0 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-12 15:20:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57959 states to 57959 states and 63919 transitions. [2024-10-12 15:20:30,108 INFO L78 Accepts]: Start accepts. Automaton has 57959 states and 63919 transitions. Word has length 360 [2024-10-12 15:20:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:30,108 INFO L471 AbstractCegarLoop]: Abstraction has 57959 states and 63919 transitions. [2024-10-12 15:20:30,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 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-12 15:20:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57959 states and 63919 transitions. [2024-10-12 15:20:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-10-12 15:20:30,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:30,146 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-10-12 15:20:30,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:30,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-12 15:20:30,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:30,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1715098698, now seen corresponding path program 1 times [2024-10-12 15:20:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:30,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719584875] [2024-10-12 15:20:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 15:20:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719584875] [2024-10-12 15:20:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719584875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733409846] [2024-10-12 15:20:30,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:30,763 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:30,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-12 15:20:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:30,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:20:30,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-12 15:20:31,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733409846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-12 15:20:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099517060] [2024-10-12 15:20:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:31,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:31,005 INFO L87 Difference]: Start difference. First operand 57959 states and 63919 transitions. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-12 15:20:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:31,856 INFO L93 Difference]: Finished difference Result 156602 states and 172875 transitions. [2024-10-12 15:20:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 363 [2024-10-12 15:20:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:31,965 INFO L225 Difference]: With dead ends: 156602 [2024-10-12 15:20:31,965 INFO L226 Difference]: Without dead ends: 98644 [2024-10-12 15:20:32,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:20:32,013 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 491 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:32,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 444 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98644 states. [2024-10-12 15:20:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98644 to 98020. [2024-10-12 15:20:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98020 states, 98019 states have (on average 1.1025719503361593) internal successors, (108073), 98019 states have internal predecessors, (108073), 0 states have call successors, (0), 0 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-12 15:20:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98020 states to 98020 states and 108073 transitions. [2024-10-12 15:20:33,441 INFO L78 Accepts]: Start accepts. Automaton has 98020 states and 108073 transitions. Word has length 363 [2024-10-12 15:20:33,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 98020 states and 108073 transitions. [2024-10-12 15:20:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 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-12 15:20:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 98020 states and 108073 transitions. [2024-10-12 15:20:33,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-10-12 15:20:33,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:33,488 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:20:33,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-12 15:20:33,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 15:20:33,689 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:33,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1751482075, now seen corresponding path program 1 times [2024-10-12 15:20:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:33,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626602304] [2024-10-12 15:20:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 221 proven. 58 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 15:20:35,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626602304] [2024-10-12 15:20:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626602304] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:20:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743998564] [2024-10-12 15:20:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:35,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:35,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:20:35,424 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:20:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-12 15:20:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:35,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:20:35,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:20:35,773 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 15:20:35,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:20:35,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743998564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:35,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:20:35,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 15:20:35,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28172320] [2024-10-12 15:20:35,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:35,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:35,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:20:35,775 INFO L87 Difference]: Start difference. First operand 98020 states and 108073 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-12 15:20:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:36,951 INFO L93 Difference]: Finished difference Result 198314 states and 218535 transitions. [2024-10-12 15:20:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:36,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 365 [2024-10-12 15:20:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:37,060 INFO L225 Difference]: With dead ends: 198314 [2024-10-12 15:20:37,060 INFO L226 Difference]: Without dead ends: 100295 [2024-10-12 15:20:37,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:20:37,085 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 417 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:37,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 77 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:20:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100295 states. [2024-10-12 15:20:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100295 to 99029. [2024-10-12 15:20:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99029 states, 99028 states have (on average 1.0827947651169367) internal successors, (107227), 99028 states have internal predecessors, (107227), 0 states have call successors, (0), 0 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-12 15:20:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99029 states to 99029 states and 107227 transitions. [2024-10-12 15:20:38,382 INFO L78 Accepts]: Start accepts. Automaton has 99029 states and 107227 transitions. Word has length 365 [2024-10-12 15:20:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:38,382 INFO L471 AbstractCegarLoop]: Abstraction has 99029 states and 107227 transitions. [2024-10-12 15:20:38,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-12 15:20:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 99029 states and 107227 transitions. [2024-10-12 15:20:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-12 15:20:38,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:38,419 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 15:20:38,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-12 15:20:38,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:20:38,620 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:38,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:38,621 INFO L85 PathProgramCache]: Analyzing trace with hash 448784164, now seen corresponding path program 1 times [2024-10-12 15:20:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204316781] [2024-10-12 15:20:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-12 15:20:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:39,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204316781] [2024-10-12 15:20:39,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204316781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:39,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:39,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:39,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195191564] [2024-10-12 15:20:39,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:39,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:39,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:39,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:39,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:39,584 INFO L87 Difference]: Start difference. First operand 99029 states and 107227 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 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-12 15:20:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:40,394 INFO L93 Difference]: Finished difference Result 200699 states and 217207 transitions. [2024-10-12 15:20:40,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:40,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 392 [2024-10-12 15:20:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:40,502 INFO L225 Difference]: With dead ends: 200699 [2024-10-12 15:20:40,502 INFO L226 Difference]: Without dead ends: 101671 [2024-10-12 15:20:40,566 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-12 15:20:40,567 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 134 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:40,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 126 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101671 states. [2024-10-12 15:20:42,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101671 to 101668. [2024-10-12 15:20:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101668 states, 101667 states have (on average 1.0815800603932446) internal successors, (109961), 101667 states have internal predecessors, (109961), 0 states have call successors, (0), 0 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-12 15:20:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101668 states to 101668 states and 109961 transitions. [2024-10-12 15:20:42,234 INFO L78 Accepts]: Start accepts. Automaton has 101668 states and 109961 transitions. Word has length 392 [2024-10-12 15:20:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 101668 states and 109961 transitions. [2024-10-12 15:20:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 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-12 15:20:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 101668 states and 109961 transitions. [2024-10-12 15:20:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-10-12 15:20:42,294 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:42,294 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, 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, 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] [2024-10-12 15:20:42,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 15:20:42,295 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:42,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash -436080176, now seen corresponding path program 1 times [2024-10-12 15:20:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:42,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292133238] [2024-10-12 15:20:42,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-10-12 15:20:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292133238] [2024-10-12 15:20:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292133238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661917702] [2024-10-12 15:20:42,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:42,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:42,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:42,799 INFO L87 Difference]: Start difference. First operand 101668 states and 109961 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-12 15:20:43,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:43,574 INFO L93 Difference]: Finished difference Result 196830 states and 212899 transitions. [2024-10-12 15:20:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:43,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 392 [2024-10-12 15:20:43,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:43,924 INFO L225 Difference]: With dead ends: 196830 [2024-10-12 15:20:43,924 INFO L226 Difference]: Without dead ends: 95975 [2024-10-12 15:20:43,978 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-12 15:20:43,979 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 212 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:43,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 289 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:20:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95975 states. [2024-10-12 15:20:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95975 to 90079. [2024-10-12 15:20:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90079 states, 90078 states have (on average 1.0674082461866383) internal successors, (96150), 90078 states have internal predecessors, (96150), 0 states have call successors, (0), 0 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-12 15:20:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90079 states to 90079 states and 96150 transitions. [2024-10-12 15:20:45,105 INFO L78 Accepts]: Start accepts. Automaton has 90079 states and 96150 transitions. Word has length 392 [2024-10-12 15:20:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:45,105 INFO L471 AbstractCegarLoop]: Abstraction has 90079 states and 96150 transitions. [2024-10-12 15:20:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-12 15:20:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 90079 states and 96150 transitions. [2024-10-12 15:20:45,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-10-12 15:20:45,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:45,367 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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] [2024-10-12 15:20:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 15:20:45,367 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1800602335, now seen corresponding path program 1 times [2024-10-12 15:20:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:45,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478845701] [2024-10-12 15:20:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-10-12 15:20:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478845701] [2024-10-12 15:20:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478845701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844495007] [2024-10-12 15:20:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 15:20:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 15:20:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 15:20:45,750 INFO L87 Difference]: Start difference. First operand 90079 states and 96150 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:20:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:46,978 INFO L93 Difference]: Finished difference Result 244163 states and 260298 transitions. [2024-10-12 15:20:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 15:20:46,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 397 [2024-10-12 15:20:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:47,172 INFO L225 Difference]: With dead ends: 244163 [2024-10-12 15:20:47,172 INFO L226 Difference]: Without dead ends: 156318 [2024-10-12 15:20:47,230 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-12 15:20:47,231 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 488 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:47,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 289 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:20:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156318 states. [2024-10-12 15:20:48,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156318 to 153263. [2024-10-12 15:20:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153263 states, 153262 states have (on average 1.0647257637248633) internal successors, (163182), 153262 states have internal predecessors, (163182), 0 states have call successors, (0), 0 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-12 15:20:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153263 states to 153263 states and 163182 transitions. [2024-10-12 15:20:49,614 INFO L78 Accepts]: Start accepts. Automaton has 153263 states and 163182 transitions. Word has length 397 [2024-10-12 15:20:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 153263 states and 163182 transitions. [2024-10-12 15:20:49,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-12 15:20:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 153263 states and 163182 transitions. [2024-10-12 15:20:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-10-12 15:20:49,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:49,656 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:49,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 15:20:49,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash 524386484, now seen corresponding path program 1 times [2024-10-12 15:20:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911999978] [2024-10-12 15:20:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-10-12 15:20:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911999978] [2024-10-12 15:20:50,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911999978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:50,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:50,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:20:50,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896480043] [2024-10-12 15:20:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:50,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:50,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:50,003 INFO L87 Difference]: Start difference. First operand 153263 states and 163182 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-12 15:20:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:51,481 INFO L93 Difference]: Finished difference Result 444955 states and 473854 transitions. [2024-10-12 15:20:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 399 [2024-10-12 15:20:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:20:51,820 INFO L225 Difference]: With dead ends: 444955 [2024-10-12 15:20:51,821 INFO L226 Difference]: Without dead ends: 294129 [2024-10-12 15:20:52,247 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-12 15:20:52,250 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 185 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:20:52,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 483 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:20:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294129 states. [2024-10-12 15:20:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294129 to 294125. [2024-10-12 15:20:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294125 states, 294124 states have (on average 1.0644388081217446) internal successors, (313077), 294124 states have internal predecessors, (313077), 0 states have call successors, (0), 0 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-12 15:20:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294125 states to 294125 states and 313077 transitions. [2024-10-12 15:20:56,764 INFO L78 Accepts]: Start accepts. Automaton has 294125 states and 313077 transitions. Word has length 399 [2024-10-12 15:20:56,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:20:56,764 INFO L471 AbstractCegarLoop]: Abstraction has 294125 states and 313077 transitions. [2024-10-12 15:20:56,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-12 15:20:56,764 INFO L276 IsEmpty]: Start isEmpty. Operand 294125 states and 313077 transitions. [2024-10-12 15:20:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-10-12 15:20:56,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:20:56,792 INFO L215 NwaCegarLoop]: trace histogram [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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 15:20:56,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 15:20:56,792 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:20:56,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:20:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1617171766, now seen corresponding path program 1 times [2024-10-12 15:20:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:20:56,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629251434] [2024-10-12 15:20:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:20:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:20:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:20:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:20:57,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:20:57,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629251434] [2024-10-12 15:20:57,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629251434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:20:57,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:20:57,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:20:57,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219480916] [2024-10-12 15:20:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:20:57,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:20:57,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:20:57,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:20:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:20:57,551 INFO L87 Difference]: Start difference. First operand 294125 states and 313077 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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-12 15:20:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:20:59,614 INFO L93 Difference]: Finished difference Result 615900 states and 655075 transitions. [2024-10-12 15:20:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:20:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 399 [2024-10-12 15:20:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:21:00,090 INFO L225 Difference]: With dead ends: 615900 [2024-10-12 15:21:00,090 INFO L226 Difference]: Without dead ends: 324212 [2024-10-12 15:21:00,285 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-12 15:21:00,286 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 162 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:21:00,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 313 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:21:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324212 states. [2024-10-12 15:21:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324212 to 324169. [2024-10-12 15:21:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324169 states, 324168 states have (on average 1.0602341995508502) internal successors, (343694), 324168 states have internal predecessors, (343694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)